341 search results - page 31 / 69 » Paired bondage in trees |
CVPR
2006
IEEE
15 years 11 months ago
2006
IEEE
This paper addresses the problem of detecting and segmenting partially occluded objects of a known category. We first define a part labelling which densely covers the object. Our ...
COCOON
2009
Springer
15 years 4 months ago
2009
Springer
It is shown that for every finite set of disjoint convex polygonal obstacles in the plane, with a total of n vertices, the free space around the obstacles can be partitioned into ...
SIGGRAPH
2000
ACM
15 years 2 months ago
2000
ACM
Approximating detailed models with coarse, texture-mapped meshes results in polygonal silhouettes. To eliminate this artifact, we introduce silhouette clipping, a framework for ef...
124
click to vote
NAACL
2010
14 years 7 months ago
2010
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
TON
2012
13 years 4 days ago
2012
—In order to achieve resilient multipath routing we introduce the concept of Independent Directed Acyclic Graphs (IDAGs) in this study. Link-independent (Node-independent) DAGs s...