1105 search results - page 150 / 221 » Linear choosability of graphs |
103
click to vote
BIRTHDAY
2010
Springer
15 years 1 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
126
click to vote
COMGEO
2006
ACM
14 years 12 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
116
click to vote
DM
2006
14 years 12 months ago
2006
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
106
click to vote
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
We present a parameter free approach that utilizes multiple cues for image segmentation. Beginning with an image, we execute a sequence of bottom-up aggregation steps in which pix...
116
click to vote
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
Traditional aspect graphs are topology-based and are impractical for articulated objects. In this work we learn a small number of aspects, or prototypical views, from video data. ...