1370 search results - page 21 / 274 » On grids in topological graphs |
CORR
2011
Springer
13 years 7 days ago
2011
Springer
Many online networks are measured and studied via sampling techniques, which typically collect a relatively small fraction of nodes and their associated edges. Past work in this a...
MFCS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
CG
2007
Springer
13 years 8 months ago
2007
Springer
In this paper, we describe a new optical tracking algorithm for pose estimation of interaction devices in virtual and augmented reality. Given a 3D model of the interaction device...
PDPTA
2004
13 years 9 months ago
2004
This paper presents our on-going research into selforganizing and self-healing networks of resource brokers, for use in complex Peer-to-Peer (P2P) resource sharing and Grid comput...
CVIU
2008
2008
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
13 years 8 months ago
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...