4865 search results - page 385 / 973 » The Complexity of Graph Connectivity |
210
click to vote
NIPS
2004
15 years 8 months ago
2004
We seek to both detect and segment objects in images. To exploit both local image data as well as contextual information, we introduce Boosted Random Fields (BRFs), which use boos...
181
click to vote
EJC
2008
15 years 6 months ago
2008
The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to i...
224
click to vote
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...
176
click to vote
DSN
2011
IEEE
14 years 6 months ago
2011
IEEE
— This paper describes a modeling framework for evaluating the impact of faults on the output of streaming ions. Our model is based on three abstractions: stream operators, strea...
182
click to vote
FCS
2006
15 years 8 months ago
2006
The problem of finding a negative cycle in a weighted, directed graph is discussed here. First the algorithm for printing out a negative cycle reachable from the source s, with th...