Sciweavers

2774 search results - page 450 / 555
» Exploiting Deep Structure
Sort
View
NIPS
2000
15 years 5 months ago
Feature Correspondence: A Markov Chain Monte Carlo Approach
When trying to recover 3D structure from a set of images, the most di cult problem is establishing the correspondence between the measurements. Most existing approaches assume tha...
Frank Dellaert, Steven M. Seitz, Sebastian Thrun, ...
UAI
2000
15 years 5 months ago
Rao-Blackwellised Particle Filtering for Dynamic Bayesian Networks
Particle filters (PFs) are powerful samplingbased inference/learning algorithms for dynamic Bayesian networks (DBNs). They allow us to treat, in a principled way, any type of prob...
Arnaud Doucet, Nando de Freitas, Kevin P. Murphy, ...
COLING
1996
15 years 5 months ago
Reversible delayed lexical choice in a bidirectional framework
We describe a bidirectional framework for natural language parsing and generation, using a typedfeatureformalismand an HPSG-based grammar with a parser and generator derived from ...
Graham Wilcock, Yuji Matsumoto
SEBD
1996
94views Database» more  SEBD 1996»
15 years 5 months ago
Efficient Algorithm for determining the Optimal Execution Strategy for Path Queries in OODBS
Abstract. To select an optimal query evaluation strategy for a path query in an object-oriented database system one has to exploit the available index structures on the path. In a ...
Weimin Chen, Karl Aberer
COLING
1992
15 years 5 months ago
Compiling and Using Finite-State Syntactic Rules
A language-independent framework for syntactic finlte-state parsing is discussed. The article presents a framework, a formalism, a compiler and a parser for grammars written in th...
Kimmo Koskenniemi, Pasi Tapanainen, Atro Voutilain...