Sciweavers

2197 search results - page 377 / 440
» Sampling community structure
Sort
View
UAI
2003
13 years 9 months ago
Strong Faithfulness and Uniform Consistency in Causal Inference
A fundamental question in causal inference is whether it is possible to reliably infer the manipulation effects from observational data. There are a variety of senses of asymptot...
Jiji Zhang, Peter Spirtes
GRAPHICSINTERFACE
2000
13 years 9 months ago
Adaptive Representation of Specular Light Flux
Caustics produce beautiful and intriguing illumination patterns. However, their complex behavior make them difficult to simulate accurately in all but the simplest configurations....
Normand Brière, Pierre Poulin
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
13 years 9 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
UAI
2000
13 years 9 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
1992
13 years 8 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...