2498 search results - page 163 / 500 » Algorithms for the Topological Watershed |
155
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
182
click to vote
CVPR
2007
IEEE
16 years 26 days ago
2007
IEEE
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
140
click to vote
ISAAC
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
196
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...
176
click to vote
BERTINORO
2005
Springer
16 years 2 days ago
2005
Springer
Decentralized peer to peer (p2p) networks like Gnutella are attractive for certain applications because they require no centralized directories and no precise control over network ...