Sciweavers

557 search results - page 50 / 112
» Visualizing Weighted Edges in Graphs
Sort
View
80
Voted
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
15 years 4 months ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...
MICCAI
2000
Springer
15 years 2 months ago
Interactive Organ Segmentation Using Graph Cuts
Abstract. An N-dimensional image is divided into "object" and "background" segments using a graph cut approach. A graph is formed by connecting all pairs of nei...
Yuri Boykov, Marie-Pierre Jolly
SWAT
2004
Springer
109views Algorithms» more  SWAT 2004»
15 years 4 months ago
Robust Subgraphs for Trees and Paths
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
Refael Hassin, Danny Segev
SMI
2006
IEEE
121views Image Analysis» more  SMI 2006»
15 years 5 months ago
Minimum Ratio Contours on Surface Meshes
We present a novel approach for discretely optimizing contours on the surface of a triangle mesh. This is achieved through the use of a minimum ratio cycle (MRC) algorithm, where ...
Andrew Clements, Hao Zhang 0002
ICRA
2010
IEEE
131views Robotics» more  ICRA 2010»
14 years 9 months ago
Optimal coverage of a known arbitrary environment
— The problem of coverage of known space by a mobile robot has many applications. Of particular interest is providing a solution that guarantees the complete coverage of the free...
Raphael Mannadiar, Ioannis M. Rekleitis