Sciweavers

785 search results - page 53 / 157
» Embedding a Forest in a Graph
Sort
View
CVPR
2010
IEEE
1171views Computer Vision» more  CVPR 2010»
14 years 5 months ago
Geodesic Star Convexity for Interactive Image Segmentation
In this paper we introduce a new shape constraint for interactive image segmentation. It is an extension of Veksler's star-convexity prior, in two ways: from a single star to ...
Varun Gulshan, Carsten Rother, Antonio Criminisi, ...
WEA
2007
Springer
104views Algorithms» more  WEA 2007»
14 years 3 months ago
Dynamic Trees in Practice
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
Robert Endre Tarjan, Renato Fonseca F. Werneck
GECCO
2004
Springer
211views Optimization» more  GECCO 2004»
14 years 2 months ago
Node-Depth Encoding for Evolutionary Algorithms Applied to Network Design
Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In gene...
Alexandre C. B. Delbem, André Carlos Ponce ...
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
14 years 10 months ago
Efficient Query Processing in Large Traffic Networks
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
JGAA
2006
108views more  JGAA 2006»
13 years 9 months ago
Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
Let G = (V, E) be a graph with n vertices and let P be a set of n points in the plane. We show that deciding whether there is a planar straight-line embedding of G such that the v...
Sergio Cabello