381 search results - page 23 / 77 » Fast Neighbor Joining |
SIGMOD
2002
ACM
15 years 10 months ago
2002
ACM
Time-parameterized queries (TP queries for short) retrieve (i) the actual result at the time that the query is issued, (ii) the validity period of the result given the current mot...
104
click to vote
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
202
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...
SSDBM
2008
IEEE
15 years 4 months ago
2008
IEEE
Random sampling is a popular technique for providing fast approximate query answers, especially in data warehouse environments. Compared to other types of synopses, random sampling...
WECWIS
2007
IEEE
15 years 4 months ago
2007
IEEE
A blog is a new media that is receiving a lot of attention. Its links enable us to get a hold of social relations between bloggers in a blog space, and the relations reflect blogg...