455 search results - page 84 / 91 » Distributed Processes on Tree Hash |
SENSYS
2004
ACM
15 years 2 months ago
2004
ACM
Previous approaches for computing duplicate-sensitive aggregates in sensor networks (e.g., in TAG) have used a tree topology, in order to conserve energy and to avoid double-count...
94
Voted
STOC
2010
ACM
15 years 2 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
102
click to vote
KDD
2007
ACM
15 years 3 months ago
2007
ACM
Mixture models form one of the most widely used classes of generative models for describing structured and clustered data. In this paper we develop a new approach for the analysis...
SIGCOMM
1994
ACM
15 years 1 months ago
1994
ACM
Existing multicast routing mechanisms were intended for use within regions where a group is widely represented or bandwidth is universally plentiful. When group members, and sende...
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
We present a number of optimization techniques to compute prefix sums on linked lists and implement them on multithreaded GPUs using CUDA. Prefix computations on linked structures ...