Sciweavers

2127 search results - page 15 / 426
» Computing large matchings fast
Sort
View
BMCBI
2006
141views more  BMCBI 2006»
13 years 7 months ago
Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
Sylvain Forêt, Miriam R. Kantorovitz, Conrad...
CVPR
2008
IEEE
14 years 9 months ago
Small codes and large image databases for recognition
The Internet contains billions of images, freely available online. Methods for efficiently searching this incredibly rich resource are vital for a large number of applications. Th...
Antonio B. Torralba, Robert Fergus, Yair Weiss
SPIRE
1998
Springer
13 years 11 months ago
Fast Approximate String Matching in a Dictionary
A successful technique to search large textual databases allowing errors relies on an online search in the vocabulary of the text. To reduce the time of that online search, we ind...
Ricardo A. Baeza-Yates, Gonzalo Navarro
SIGGRAPH
2000
ACM
13 years 11 months ago
Time-dependent visual adaptation for fast realistic image display
Human vision takes time to adapt to large changes in scene intensity, and these transient adjustments have a profound effect on visual appearance. This paper offers a new operator...
Sumanta N. Pattanaik, Jack Tumblin, Yangli Hector ...
ICPR
2000
IEEE
14 years 8 months ago
Fast Graph Matching for Detecting CAD Image Components
Luigi P. Cordella, Pasquale Foggia, Carlo Sansone,...