1421 search results - page 72 / 285 » Algorithms for subsequence combinatorics |
CPM
2010
Springer
15 years 7 months ago
2010
Springer
A proper factor u of a string y is a cover of y if every letter of y is within some occurrence of u in y. The concept generalises the notion of periods of a string. An integer arra...
123
click to vote
CIE
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
144
click to vote
COMPGEOM
2005
ACM
15 years 5 months ago
2005
ACM
Using inclusion-exclusion, we can write the indicator function of a union of finitely many balls as an alternating sum of indicator functions of common intersections of balls. We...
128
click to vote
COMPGEOM
2005
ACM
15 years 5 months ago
2005
ACM
In this paper, we bound the difference between the total mean curvatures of two closed surfaces in R3 in terms of their total absolute curvatures and the Fr´echet distance betwee...
114
click to vote
ECCV
2006
Springer
15 years 6 months ago
2006
Springer
The recovery of 3D shape and camera motion for non-rigid scenes from single-camera video footage is a very important problem in computer vision. The low-rank shape model consists ...