14 search results - page 3 / 3 » Optimal Construction Of Edge-Disjoint Paths In Random Regula... |
253
Voted
IJWMC
2010
15 years 4 months ago
2010
Coverage, fault tolerance and power consumption constraints make optimal placement of mobile sensors or other mobile agents a hard problem. We have developed a model for describin...
182
click to vote
ECCC
2006
15 years 7 months ago
2006
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
187
click to vote
ICCV
2009
IEEE
17 years 11 days ago
2009
IEEE
This paper is focused on the Co-segmentation problem
[1] – where the objective is to segment a similar object from
a pair of images. The background in the two images may be
ar...
214
Voted
SPAA
2003
ACM
16 years 19 days 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...