1162 search results - page 40 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
144
click to vote
FAW
2009
Springer
15 years 10 months ago
2009
Springer
Data access time becomes the main bottleneck in applications dealing with large-scale graphs. Cache-oblivious layouts, constructed to minimize the geometric mean of arc lengths of ...
125
click to vote
FCCM
2006
IEEE
15 years 10 months ago
2006
IEEE
— Many important applications are organized around long-lived, irregular sparse graphs (e.g., data and knowledge bases, CAD optimization, numerical problems, simulations). The gr...
133
Voted
ECCV
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. A novel method is proposed for performing multi-label, semi-automated image segmentation. Given a small number of pixels with user-defined labels, one can analytically (...
127
click to vote
OSS
2009
Springer
15 years 10 months ago
2009
Springer
This paper presents a novel method and algorithm to measure the size of an open source project’s user base and the level of potential user interest that it generates. Previously ...
120
click to vote
LOPSTR
2004
Springer
15 years 9 months ago
2004
Springer
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...