19,330 Hits in 2.8 sec

Fully Incremental LCS Computation [chapter]

Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
2005 Lecture Notes in Computer Science  
This paper considers the fully incremental LCS computation problem as follows: For any strings A, B and characters a, b, compute LCS(aA, B), LCS(A, bB), LCS(Aa, B), and LCS(A, Bb), provided that L = LCS  ...  (A, B) is already computed.  ...  A Fully Incremental LCS Computation Algorithm In this section we produce an efficient algorithm to solve the fully incremental LCS computation problem, where the problem is to compute the LCS of given  ... 
doi:10.1007/11537311_49 fatcat:gkjpolopcrgs3c23wkfshuo2om

Quantification, prediction, and the online impact of sentence truth-value: Evidence from event-related potentials

Mante S. Nieuwland
2016 Journal of Experimental Psychology. Learning, Memory and Cognition  
Fully incremental quantifier interpretation occurs when quantifiers are incorporated into sufficiently strong online predictions for upcoming words.  ...  Quantifier sentences are thus understood neither always in 2 sequential stages, nor always in a partial-incremental fashion, nor always in a maximally incremental fashion.  ...  At least some amount of prediction appears to be required for fully incremental comprehension of quantifiers.  ... 
doi:10.1037/xlm0000173 pmid:26375784 pmcid:PMC4734228 fatcat:bc5qyd4ecfhkdkjdv4aoafgvae

Active learning: a step towards automating medical concept extraction

Mahnoosh Kholghi, Laurianne Sitbon, Guido Zuccon, Anthony Nguyen
2015 JAMIA Journal of the American Medical Informatics Association  
Materials and methods The comparative performance of an active learning framework and a fully supervised approach were investigated to study how active learning reduces the annotation effort while achieving  ...  Discussion Incremental active learning guarantees robustness across all selection criteria and datasets.  ...  The annotation rates from Table 2 show that LC requires less annotation effort to reach the target performance. Information density is computationally costly compared to least confidence.  ... 
doi:10.1093/jamia/ocv069 pmid:26253132 fatcat:ybvmqjcetzcs7ofbnqxeh4ac5u

An efficient fault-tolerant location management protocol for personal communication networks

K. Ratnam, S. Rangarajan, A.T. Dahbura
2000 IEEE Transactions on Vehicular Technology  
His research interests are quality of service, voice over IP, and mobile computing.  ...  Karunaharan Ratnam recieved B.Sc.Eng. degree in electrical engineering from the University of Peradeniya, Sri Lanka, in 1990 and the M.S. degree in electrical and computer engineering from the University  ...  Both LRs will increment this tied LC value and send a check message to MH along with the incremented LC value (i.e., 12) .  ... 
doi:10.1109/25.901904 fatcat:yw6cznogpfal5lbcivsu544tbu

Strengthening invariants for efficient computation

Yanhong A. Liu, Scott D. Stoller, Tim Teitelbaum
2001 Science of Computer Programming  
Finding the stronger invariants corresponds to discovering a general class of auxiliary information for any incremental computation problem.  ...  This paper presents program analyses and transformations for strengthening invariants for the purpose of e cient computation.  ...  We incrementalize lcs under the input change operation n ; m = n; m ⊕ = n + 1; m , identiÿed using the method in [51] as a minimum input increment operation, and obtain Computing lcs(n+1; m) from scratch  ... 
doi:10.1016/s0167-6423(01)00003-x fatcat:dm5vlrsrira6xmqj3mhpqhyyyi

Learning classifier systems

Abubakar Siddique, Will Browne
2022 Proceedings of the Genetic and Evolutionary Computation Conference Companion  
) Genetic operator pressure 83 (Adapted from Butz 2010) LCS Pressures 84 Set Pressure  A fully specific classifier is fully accurate  Unnecessarily slow and memory intensive  Opportunity to breed, i.e  ...  used to motivate directions for further LCS enhancements.  ...  Problem Class 76 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 1 1 0 0 0 0 1 0 0 0 0 0 0 1 0 1 0 0 0 0 1 1 0 0 Solution space Sample space LCS Learning Take Home Message: LCS  ... 
doi:10.1145/3520304.3533664 fatcat:d43exrpucvg37dvrcat4rjftbm

A Rollback in the History of Communication-Induced Checkpointing [article]

Islene C. Garcia, Gustavo M. D. Vieira, Luiz E. Buzato
2019 arXiv   pre-print
For many years, HMNR, also called Fully Informed (FI), was the most complex and efficient protocol of this family.  ...  Recently, the Fully Informed aNd Efficient (FINE) protocol was proposed using the same control structures as FI, but with a stronger and, presumably better, checkpoint-inducing condition.  ...  These rules can be seen as a specialization of the Lamport's clock [7] that increments lc i only at the occurrence of checkpoints. • P i initializes lc i at the beginning of the computation; • P i increments  ... 
arXiv:1702.06167v2 fatcat:herxsdlc4rhx5kwstwd7smqvse

Two-Branch Attention Learning for Fine-Grained Class Incremental Learning

Jiaqi Guo, Guanqiu Qi, Shuiqing Xie, Xiangyuan Li
2021 Electronics  
As a long-standing research area, class incremental learning (CIL) aims to effectively learn a unified classifier along with the growth of the number of classes.  ...  In this strategy, a prototype is computed by averaging the features extracted from all samples of the same class.  ...  The extracted feature map passes a fully connected (FC) layer followed by the detection head. Figure 2 . 2 Figure 2.  ... 
doi:10.3390/electronics10232987 fatcat:5exljd2vbfh4hjwnb75mot4wge

The Elastic Share of Inelastic Stress–Strain Paths of Woven Fabrics

Mehran Motevalli, Jörg Uhlemann, Natalie Stranghöner, Daniel Balzani
2020 Materials  
The irreversible strain increment is given related to the total strain increment.  ...  Subsequently, with the computed coefficients, the associated material parameters are estimated at LC 1000.  ...  (a) Irreversible strain increment vs. load cycles; (b) irreversible strain increment vs. load cycles; (c) total strain vs. load cycles; (d) total strain vs. load cycles; (e) intensity of nonlinearity vs  ... 
doi:10.3390/ma13194243 pmid:32977638 fatcat:kndrs5c4yjfq7ehcirqcee27fm

Efficient Incremental Computation of Aggregations over Sliding Windows

Chao Zhang, Reza Akbarinia, Farouk Toumani
2021 Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining  
Computing aggregation over sliding windows, i.e., finite subsets of an unbounded stream, is a core operation in streaming analytics.  ...  Aggregator), a novel parallel algorithm that groups continuous slices of streaming values into chunks and exploits two buffers, cumulative slice aggregations and left cumulative slice aggregations, to compute  ...  We incrementally compute partial aggregations for every chunk to compute SWAGs. PBA applies two kinds of incremental aggregations: (i) computing 𝑐𝑠𝑎 and (ii) computing 𝑙𝑐𝑠.  ... 
doi:10.1145/3447548.3467360 fatcat:szdsgp2wvrgerctgbiytdhq4du

A constitutive model for unsaturated soils: thermomechanical and computational aspects

D. Sheng, S. W. Sloan, A. Gens
2004 Computational Mechanics  
All plastic work associated with a plastic increment of the degree of saturation is stored and can be recovered in a reversed plastic increment of saturation.  ...  The incremental constitutive equations are also reformulated for implementation in finite element codes where displacements and pore pressures are primary unknowns.  ...  If the preconsolidation pressure p 0 c is a known function of suction s, the evolution of the LC yield surface is fully controlled by the preconsolidation pressure p 0 0 at s =0.  ... 
doi:10.1007/s00466-003-0545-x fatcat:3u3cljtwobdcpp2o7vc5g647pq

Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism

Valerio Freschi, Alessandro Bogliolo
2004 Information Processing Letters  
In this paper we address the problem of computing the length of the longest common subsequence (LCS) between run-length-encoded (RLE) strings.  ...  We exploit RLE both to reduce the complexity of LCS computation from O(M × N) to O(mN + Mn − mn), where M and N are the lengths of the original strings and m and n the number of runs in their RLE representation  ...  Entry LCS(i, j ) represents the LCS between the first i characters of X and the first j characters of Y , and can be incrementally computed from LCS(i − 1, j), LCS(i − 1, j − 1) and LCS(i, j − 1) by means  ... 
doi:10.1016/j.ipl.2004.02.011 fatcat:q5lbsxhowzgy7nmk4dpyd6za5a

Multiplication Algorithms for Monge Matrices [chapter]

Luís M. S. Russo
2010 Lecture Notes in Computer Science  
Their applications to string processing problems, include: Cyclic LCS, Longest Repeated subsequence, Fully-Incremental LCS [5, 6, 4] , etc. Alves et al.  ...  This result has a significant impact on string problems [13] , namely Cyclic LCS, Longest Repeated Subsequence, Fully-Incremental LCS [5, 6] , etc.  ... 
doi:10.1007/978-3-642-16321-0_9 fatcat:zpr3yw7dybbefdl6iyhwtq6z6m

Efficient penetration depth approximation using active learning

Jia Pan, Xinyu Zhang, Dinesh Manocha
2013 ACM Transactions on Graphics  
Our approach is applicable to all rigid models and can compute translational and gener-  ...  In this case, we locally refine LCS by incorporating q0 into LCS using incremental learning (see Section 4.4).  ...  Incremental Learning Instead of computing a new decision function from scratch using all the previous samples, we apply incremental learning techniques to efficiently compute LCSi+1 from LCSi.  ... 
doi:10.1145/2508363.2508305 fatcat:gsxmbpv74nbu5lcnn6w5ndnrm4

Efficient probabilistic top-down and left-corner parsing

Brian Roark, Mark Johnson
1999 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics -  
In contrast to bottom-up methods, depth-first top-down parsing produces partial parses that are fully connected trees spanning the entire left context, from which any kind of non-local dependency or partial  ...  LC o RB.  ...  (a) LB o LC (b) RB o LC (c) LC o LB (d) LC o RB RB o LC performs with higher accuracy than the others when used with an exhaustive parser, but seems to require a massive beam in order to even approach  ... 
doi:10.3115/1034678.1034743 dblp:conf/acl/RoarkJ99 fatcat:x26bw6ee5feanb3plt6pwesaoa
« Previous Showing results 1 — 15 out of 19,330 results