589 search results - page 27 / 118 » Matching Concavity Trees |
SIAMCOMP
2000
14 years 9 months ago
2000
We modify the k-d tree on [0, 1]d by always cutting the longest edge instead of rotating through the coordinates. This modification makes the expected time behavior of lowerdimensi...
85
Voted
3DIM
2005
IEEE
15 years 3 months ago
2005
IEEE
One of the difficulties in registering two range images scanned by 3D laser scanners is how to get a correct correspondence over the two images automatically. In this paper, we pr...
NAACL
2003
14 years 11 months ago
2003
We introduce two probabilistic models that can be used to identify elementary discourse units and build sentence-level discourse parse trees. The models use syntactic and lexical ...
102
Voted
CVPR
2012
IEEE
13 years 3 days ago
2012
IEEE
Matching patches between two images, also known as computing nearest-neighbor fields, has been proven a useful technique in various computer vision/graphics algorithms. But this ...
IPMI
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. A method for quantitative assessment of tree structures is reported allowing evaluation of airway or vascular tree morphology and its associated function. Our skeletoniza...