Sciweavers

2869 search results - page 183 / 574
» The Inference Problem: A Survey
Sort
View
JDA
2006
184views more  JDA 2006»
15 years 4 months ago
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
Camil Demetrescu, Giuseppe F. Italiano
GRC
2010
IEEE
15 years 5 months ago
Learning Multiple Latent Variables with Self-Organizing Maps
Inference of latent variables from complicated data is one important problem in data mining. The high dimensionality and high complexity of real world data often make accurate infe...
Lili Zhang, Erzsébet Merényi
DAGSTUHL
1997
15 years 5 months ago
Scattered Data Techniques for Surfaces
This survey presents several techniques for solving variants of the following scattered data interpolation problem: given a nite set of N points in R3, nd a surface that interpola...
Suresh K. Lodha, Richard Franke
CVPR
2004
IEEE
16 years 6 months ago
Graphical Models for Graph Matching
This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler mo...
Dante Augusto Couto Barone, Terry Caelli, Tib&eacu...
ICML
2009
IEEE
16 years 5 months ago
Polyhedral outer approximations with application to natural language parsing
Recent approaches to learning structured predictors often require approximate inference for tractability; yet its effects on the learned model are unclear. Meanwhile, most learnin...
André F. T. Martins, Noah A. Smith, Eric P....