Sciweavers

1700 search results - page 172 / 340
» Combinatorial Pattern Matching
Sort
View
CPM
2000
Springer
124views Combinatorics» more  CPM 2000»
14 years 2 months ago
Indexing Text with Approximate q-Grams
We present a new index for approximate string matching. The index collects text q-samples, that is, disjoint text substrings of length q, at fixed intervals and stores their posi...
Gonzalo Navarro, Erkki Sutinen, Jani Tanninen, Jor...
CGF
2008
144views more  CGF 2008»
13 years 10 months ago
Deformation-Driven Shape Correspondence
Non-rigid 3D shape correspondence is a fundamental and difficult problem. Most applications which require a correspondence rely on manually selected markers. Without user assistan...
Hao Zhang 0002, Alla Sheffer, Daniel Cohen-Or, Qua...
COMBINATORICS
1999
90views more  COMBINATORICS 1999»
13 years 10 months ago
On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...
Anna Galluccio, Martin Loebl
MVA
2002
175views Computer Vision» more  MVA 2002»
13 years 10 months ago
Augmented geophysical data interpretation through automated velocity picking in semblance velocity images
Velocity Picking is the problem of picking velocity-time pairs based on a coherence metric between multiple seismic signals. Coherence as a function of velocity and time can be ex...
J. Ross Beveridge, Charlie Ross, L. Darrell Whitle...
ISM
2006
IEEE
174views Multimedia» more  ISM 2006»
14 years 4 months ago
Fast Similarity Search for High-Dimensional Dataset
This paper addresses the challenging problem of rapidly searching and matching high-dimensional features for the applications of multimedia database retrieval and pattern recognit...
Quan Wang, Suya You