381 search results - page 16 / 77 » Fast Neighbor Joining |
107
click to vote
GLOBECOM
2006
IEEE
15 years 4 months ago
2006
IEEE
— In this paper we investigate which is the most efficient architecture and protocol that can be used for file distribution. The focus of the analysis is to understand not only...
111
click to vote
SDM
2012
SIAM
13 years 9 days ago
2012
SIAM
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
122
click to vote
EDBT
2006
ACM
15 years 1 months ago
2006
ACM
Utilizing spatial index structures on secondary memory for nearest neighbor search in high-dimensional data spaces has been the subject of much research. With the potential to host...
137
click to vote
ICML
2006
IEEE
15 years 6 months ago
2006
IEEE
We present a tree data structure for fast
nearest neighbor operations in general n-
point metric spaces (where the data set con-
sists of n points). The data structure re-
quir...
111
click to vote
SIGMOD
2003
ACM
15 years 10 months ago
2003
ACM
We consider the problem of approximating sliding window joins over data streams in a data stream processing system with limited resources. In our model, we deal with resource cons...