Sciweavers

2294 search results - page 84 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
PAMI
2010
188views more  PAMI 2010»
14 years 4 months ago
Watershed Cuts: Thinnings, Shortest Path Forests, and Topological Watersheds
We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, our main contribution is a thinning paradigm from which we derive three alg...
Jean Cousty, Gilles Bertrand, Laurent Najman, Mich...
INFOCOM
2003
IEEE
15 years 3 months ago
Sampling Biases in IP Topology Measurements
— Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute-like methods have led s...
Anukool Lakhina, John W. Byers, Mark Crovella, Pen...
IVC
2000
136views more  IVC 2000»
14 years 9 months ago
Heading direction of a mobile robot from the optical flow
Ben J. A. Kröse, Anuj Dev, Frans C. A. Groen
TCOS
2010
14 years 8 months ago
Approximate Shortest Path Queries Using Voronoi Duals
We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simp...
Shinichi Honiden, Michael E. Houle, Christian Somm...
TVCG
2012
185views Hardware» more  TVCG 2012»
13 years 6 days ago
Interest Driven Navigation in Visualization
—This paper describes a new method to explore and discover within a large data set. We apply techniques from preference elicitation to automatically identify data elements that a...
Christopher G. Healey, Brent M. Dennis