Sciweavers

868 search results - page 34 / 174
» A general compression algorithm that supports fast searching
Sort
View
NIPS
2007
13 years 9 months ago
A learning framework for nearest neighbor search
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...
Lawrence Cayton, Sanjoy Dasgupta
CIKM
2009
Springer
14 years 2 months ago
Compressing tags to find interesting media groups
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...
Matthijs van Leeuwen, Francesco Bonchi, Börku...
ICDE
2002
IEEE
204views Database» more  ICDE 2002»
14 years 9 months ago
Approximating a Data Stream for Querying and Estimation: Algorithms and Performance Evaluation
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,...
Sudipto Guha, Nick Koudas
RECOMB
2001
Springer
14 years 8 months ago
Fast recovery of evolutionary trees with thousands of nodes
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...
Miklós Csürös
DAM
2008
136views more  DAM 2008»
13 years 7 months ago
General theory of information transfer: Updated
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...
Rudolf Ahlswede