214 search results - page 35 / 43 » The node capacitated graph partitioning problem: A computati... |
109
Voted
BROADNETS
2004
IEEE
15 years 7 months ago
2004
IEEE
Failure resilience is one of the desired features of the Internet. Most of the traditional restoration architectures are based on single-failure assumption which is unrealistic. M...
149
Voted
INFOCOM
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
118
click to vote
HM
2007
Springer
15 years 9 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
120
Voted
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
We investigate the problem of converting sets of sensors into strongly connected networks of sensors using multiple directional antennae. Consider a set S of n points in the plane...
147
Voted
ICWN
2008
15 years 5 months ago
2008
: Problem statement: For a sensor network comprising autonomous and self-organizing data sources, efficient similarity-based search for semantic-rich resources (such as video data)...