Sciweavers

193 search results - page 11 / 39
» Fast searches for effective optimization phase sequences
Sort
View
110
Voted
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
15 years 1 months ago
Key-Independent Optimality
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...
John Iacono
SSDBM
2003
IEEE
141views Database» more  SSDBM 2003»
15 years 7 months ago
The ed-tree: An Index for Large DNA Sequence Databases
The growing interest in genomic research has caused an explosive growth in the size of DNA databases making it increasely challenging to perform searches on them. In this paper, w...
Zhenqiang Tan, Xia Cao, Beng Chin Ooi, Anthony K. ...
134
Voted
ECCV
2010
Springer
15 years 2 months ago
Robust and Fast Collaborative Tracking with Two Stage Sparse Optimization
Abstract. The sparse representation has been widely used in many areas and utilized for visual tracking. Tracking with sparse representation is formulated as searching for samples ...
Baiyang Liu, Lin Yang, Junzhou Huang, Peter Meer, ...
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
16 years 1 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...
130
Voted
CVPR
2010
IEEE
15 years 25 days ago
Transform Coding for Fast Approximate Nearest Neighbor Search in High Dimensions
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...
Jonathan Brandt