381 search results - page 14 / 77 » Fast Neighbor Joining |
ICC
2008
IEEE
15 years 4 months ago
2008
IEEE
—Layered streaming in overlay networks has drawn great interests since not only can it accomodate large scales of clients but also it handles client heterogeneities. However, to ...
100
click to vote
DCC
1995
IEEE
15 years 1 months ago
1995
IEEE
: In fractal image compression the encoding step is computationally expensive. A large number of sequential searches through a list of domains (portions of the image) are carried o...
FOCS
2006
IEEE
15 years 4 months ago
2006
IEEE
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
INFOCOM
2011
IEEE
14 years 1 months ago
2011
IEEE
—We consider the problem of neighbor discovery in wireless networks with nodes operating in multiple frequency bands and with asymmetric beacon intervals. This is a challenging t...
NIPS
2007
14 years 11 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...