335 search results - page 26 / 67 » How to Use Spanning Trees to Navigate in Graphs |
145
click to vote
DAGM
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We present a hierarchical partitioning of images using a pairwise similarity function on a graph-based representation of an image. This function measures the difference ...
160
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
162
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
176
click to vote
WADS
2007
Springer
16 years 4 days ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
177
click to vote
VLDB
2002
ACM
15 years 5 months ago
2002
ACM
RTMonitor is a real-time data management system for traffic navigation applications. In our system, mobile vehicles initiate time-constrained navigation requests and RTMonitor cal...