2069 search results - page 219 / 414 » Linear time algorithms for Clobber |
120
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The cornerstone of any algorithm computing all repetitions in a string of length n in O(n) time is the fact that the number of runs (or maximal repetitions) is O(n). We give a simp...
231
click to vote
PODS
2011
ACM
14 years 9 months ago
2011
ACM
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
223
click to vote
BMCBI
2002
15 years 6 months ago
2002
Background: Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algo...
204
click to vote
CVPR
2009
IEEE
16 years 1 months ago
2009
IEEE
Efficient and accurate fitting of Active Appearance Models (AAM) is a key requirement for many applications. The most efficient fitting algorithm today is Inverse Compositiona...
212
click to vote
NIPS
2001
15 years 8 months ago
2001
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...