Sciweavers

444 search results - page 49 / 89
» Sensitive state-space exploration
Sort
View
AAAI
2006
15 years 1 months ago
Memory Intensive Branch-and-Bound Search for Graphical Models
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sens...
Radu Marinescu 0002, Rina Dechter
TREC
2003
15 years 1 months ago
Relevance Propagation for Topic Distillation UIUC TREC 2003 Web Track Experiments
In this paper, we report our experiments on the Web Track TREC-2003. We submitted five runs for the topic distillation task. Our goal was to evaluate the standard language modeli...
Azadeh Shakery, ChengXiang Zhai
AAAI
2007
15 years 2 months ago
Best-First AND/OR Search for Graphical Models
The paper presents and evaluates the power of best-first search over AND/OR search spaces in graphical models. The main virtue of the AND/OR representation is its sensitivity to ...
Radu Marinescu 0002, Rina Dechter
IJCV
2008
282views more  IJCV 2008»
16 years 4 months ago
Stereo Matching Using Population-Based MCMC
In this paper, we propose a new stereo matching method using the population-based Markov Chain Monte Carlo (Pop-MCMC), which belongs to the sampling-based methods. Since the previo...
Wonsik Kim (Seoul National University), Joonyoung ...
DAC
2004
ACM
16 years 24 days ago
Abstraction of assembler programs for symbolic worst case execution time analysis
ion of Assembler Programs for Symbolic Worst Case Execution Time Analysis Tobias Schuele Tobias.Schuele@informatik.uni-kl.de Klaus Schneider Klaus.Schneider@informatik.uni-kl.de Re...
Klaus Schneider, Tobias Schüle