1538 search results - page 86 / 308 » Spectral Techniques in Graph Algorithms |
102
click to vote
IJCAI
2007
15 years 2 months ago
2007
There is currently much interest in using external memory, such as disk storage, to scale up graph-search algorithms. Recent work shows that the local structure of a graph can be ...
109
click to vote
CVPR
2004
IEEE
16 years 3 months ago
2004
IEEE
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...
127
click to vote
SIGSOFT
2003
ACM
16 years 2 months ago
2003
ACM
This paper presents a novel approach for automated test data generation of imperative programs containing integer, boolean and/or float variables. It extends our previous work to ...
108
click to vote
SIROCCO
2010
15 years 2 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
117
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
We develop a new technique for computing maximum flow in directed planar graphs with multiple sources and a single sink that significantly deviates from previously known techniqu...