868 search results - page 34 / 174 » A general compression algorithm that supports fast searching |
113
Voted
NIPS
2007
15 years 5 months ago
2007
Can we leverage learning techniques to build a fast nearest-neighbor (ANN) retrieval data structure? We present a general learning framework for the NN problem in which sample que...
112
Voted
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
On photo sharing websites like Flickr and Zooomr, users are offered the possibility to assign tags to their uploaded pictures. Using these tags to find interesting groups of sem...
249
Voted
ICDE
2002
IEEE
16 years 5 months ago
2002
IEEE
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
119
Voted
RECOMB
2001
Springer
16 years 3 months ago
2001
Springer
We present a novel distance-based algorithm for evolutionary tree reconstruction. Our algorithm reconstructs the topology of a tree with n leaves in O(n2 ) time using O(n) working...
132
click to vote
DAM
2008
15 years 3 months ago
2008
We report on ideas, problems and results, which occupied us during the past decade and which seem to extend the frontiers of information theory in several directions. The main con...