46 search results - page 9 / 10 » Parallel and Distributed Graph Cuts by Dual Decomposition |
CLUSTER
2002
IEEE
13 years 5 months ago
2002
IEEE
In this paper, we propose an on-demand distributed clustering algorithm for multi-hop packet radio networks. These types of networks, also known as ad hoc networks, are dynamic in ...
SPAA
2006
ACM
14 years 4 hour ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
CLOUD
2010
ACM
13 years 11 months ago
2010
ACM
This work addresses the need for stateful dataflow programs that can rapidly sift through huge, evolving data sets. These data-intensive applications perform complex multi-step c...
SPAA
2003
ACM
13 years 11 months ago
2003
ACM
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
NIPS
2004
13 years 7 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...