3757 search results - page 290 / 752 » The overlap number of a graph |
160
click to vote
TAP
2008
Springer
15 years 6 months ago
2008
Springer
It has been known for some time that larger graphs can be interpreted if laid out in 3D and displayed with stereo and/or motion depth cues to support spatial perception. However, ...
175
click to vote
FOCS
2003
IEEE
15 years 12 months ago
2003
IEEE
We consider the problem of clustering a collection of elements based on pairwise judgments of similarity and dissimilarity. Bansal, Blum and Chawla (in: Proceedings of 43rd FOCS, ...
176
click to vote
APPML
2007
15 years 6 months ago
2007
It is shown that every planar graph with no separating triangles is a subgraph of a Hamiltonian planar graph; that is, Whitney’s theorem holds without the assumption of a triang...
172
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
In this work, we present a common framework for seeded image segmentation algorithms that yields two of the leading methods as special cases - The Graph Cuts and the Random Walker...
155
click to vote
FLOPS
2010
Springer
16 years 1 months ago
2010
Springer
Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In this paper we show ...