Sciweavers

1290 search results - page 31 / 258
» Popular Matchings: Structure and Algorithms
Sort
View
DASFAA
2003
IEEE
151views Database» more  DASFAA 2003»
15 years 9 months ago
Approximate String Matching in DNA Sequences
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
Lok-Lam Cheng, David Wai-Lok Cheung, Siu-Ming Yiu
ICDE
2006
IEEE
183views Database» more  ICDE 2006»
15 years 10 months ago
Similarity Queries on Structured Data in Structured Overlays
Structured P2P systems based on distributed hash tables are a popular choice for building large-scaled data management systems. Generally, they only support exact match queries, b...
Marcel Karnstedt, Kai-Uwe Sattler, Manfred Hauswir...
ICIP
2002
IEEE
16 years 6 months ago
New dictionary and fast atom searching method for matching pursuit representation of displaced frame difference
Matching Pursuit decomposes a signal into a linear expansion of functions selected from a redundant dictionary, isolating the signal structures that are coherent with respect to a...
Fulvio Moschetti, Lorenzo Granai, Pierre Vanderghe...
ICCV
2009
IEEE
15 years 2 months ago
An algebraic model for fast corner detection
This paper revisits the classical problem of detecting interest points, popularly known as "corners," in 2D images by proposing a technique based on fitting algebraic sh...
Andrew Willis, Yunfeng Sui
FOCS
2008
IEEE
15 years 11 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder