8697 search results - page 418 / 1740 » Measures of Distributional Similarity |
208
click to vote
DC
2008
15 years 7 months ago
2008
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...
170
click to vote
JACM
2006
15 years 6 months ago
2006
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...
278
click to vote
JPDC
2007
15 years 6 months ago
2007
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
227
click to vote
PODS
2012
ACM
13 years 9 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
326
click to vote
ICDCS
2012
IEEE
13 years 9 months ago
2012
IEEE
Datacenter networks typically have many paths connecting each host pair to achieve high bisection bandwidth for arbitrary communication patterns. Fully utilizing the bisection ban...