Sciweavers

1272 search results - page 167 / 255
» Approximate Parameterized Matching
Sort
View
112
Voted
ECCV
2006
Springer
16 years 5 months ago
Discovering Texture Regularity as a Higher-Order Correspondence Problem
Abstract. Understanding texture regularity in real images is a challenging computer vision task. We propose a higher-order feature matching algorithm to discover the lattices of ne...
James Hays, Marius Leordeanu, Alexei A. Efros, Yan...
139
Voted
ICIP
2004
IEEE
16 years 5 months ago
Shape estimation of 3-D DNA molecules from stereo cryo-electron micro-graphs
We introduce a 3-D parametric active contour algorithm for the shape estimation of DNA molecules from stereo cryo-electron micrographs. We consider a 3-D filament (consisting of a...
Mathews Jacob, Thierry Blu, Michael Unser
SIGMOD
2005
ACM
109views Database» more  SIGMOD 2005»
16 years 3 months ago
Query-Sensitive Embeddings
A common problem in many types of databases is retrieving the most similar matches to a query object. Finding those matches in a large database can be too slow to be practical, es...
Vassilis Athitsos, Marios Hadjieleftheriou, George...
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
16 years 3 months ago
FleXPath: Flexible Structure and Full-Text Querying for XML
Querying XML data is a well-explored topic with powerful databasestyle query languages such as XPath and XQuery set to become W3C standards. An equally compelling paradigm for que...
Sihem Amer-Yahia, Laks V. S. Lakshmanan, Shashank ...
128
Voted
AIRS
2004
Springer
15 years 9 months ago
On Bit-Parallel Processing of Multi-byte Text
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
Heikki Hyyrö, Jun Takaba, Ayumi Shinohara, Ma...