1162 search results - page 35 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
107
click to vote
ICCV
2001
IEEE
16 years 5 months ago
2001
IEEE
We introduce a new graph-theoretic approach to image segmentation based on minimizing a novel class of `mean cut' cost functions. Minimizing these cost functions corresponds ...
125
click to vote
ADHOC
2010
15 years 4 months ago
2010
We investigate the problem of sleep/wake scheduling for low duty cycle sensor networks. Our work differs from prior work in that we explicitly consider the effect of synchronizati...
128
click to vote
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
In this paper we present new algorithms for spectral graph partitioning. Previously, the best partitioning methods were based on a combination of Combinatorial algorithms and appli...
127
click to vote
ICRA
2008
IEEE
15 years 10 months ago
2008
IEEE
— This paper focuses on the assignment of discrete points to two robots, in the presence of geometric and kinematic constraints between the robots. The individual points have dif...
139
click to vote
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— A wide range of applications for wireless ad hoc networks are time-critical and impose stringent requirement on the communication latency. This paper studies the problem Minimu...