836 search results - page 126 / 168 » Orthogonal Colorings of Graphs |
127
click to vote
ICCV
2007
IEEE
16 years 3 months ago
2007
IEEE
The standard graph cut technique is a robust method for globally optimal image segmentations. However, because of its global nature, it is prone to capture outlying areas similar ...
102
Voted
WETICE
1996
IEEE
15 years 6 months ago
1996
IEEE
The Multi-Head, Multi-Tail, Multi-Client (MMM) Browsing Project is a continuing effort to bring stronger graph semantics to the World Wide Web thereby increasing the Web's us...
134
click to vote
ECCV
2002
Springer
16 years 3 months ago
2002
Springer
We address the problem of computing the 3-dimensional shape of an arbitrary scene from a set of images taken at known viewpoints. Multi-camera scene reconstruction is a natural gen...
115
click to vote
MICCAI
2008
Springer
16 years 3 months ago
2008
Springer
Automatic image analysis of histopathology specimens would help the early detection of blood cancer. The first step for automatic image analysis is segmentation. However, touching ...
111
click to vote
CHI
2009
ACM
16 years 2 months ago
2009
ACM
Graphs are often visualized using node-link representations: vertices are depicted as dots, edges are depicted as (poly)lines connecting two vertices. A directed edge running from...