Sciweavers

2834 search results - page 133 / 567
» Representing Trees with Constraints
Sort
View
CVPR
1998
IEEE
15 years 11 days ago
The Sample Tree: A Sequential Hypothesis Testing Approach to 3D Object Recognition
A method is presented for e cient and reliable object recognition within noisy, cluttered, and occluded range images. The method is based on a strategy which hypothesizes the inte...
Michael A. Greenspan
ALENEX
2010
163views Algorithms» more  ALENEX 2010»
13 years 11 months ago
Succinct Trees in Practice
We implement and compare the major current techniques for representing general trees in succinct form. This is important because a general tree of n nodes is usually represented i...
Diego Arroyuelo, Rodrigo Cánovas, Gonzalo N...
IDEAL
2009
Springer
14 years 2 months ago
Web Feed Clustering and Tagging Aggregator Using Topological Tree-Based Self-Organizing Maps
With the rapid and dramatic increase in web feeds published by different publishers, providers or websites via Really Simple Syndication (RSS) and Atom, users cannot be expected t...
Richard T. Freeman
ACL
2010
13 years 8 months ago
Efficient Inference through Cascades of Weighted Tree Transducers
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...
Jonathan May, Kevin Knight, Heiko Vogler
AI
2010
Springer
13 years 10 months ago
Implementing logical connectives in constraint programming
Combining constraints using logical connectives such as disjunction is ubiquitous in constraint programming, because it adds considerable expressive power to a constraint language...
Christopher Jefferson, Neil C. A. Moore, Peter Nig...