Sciweavers

1088 search results - page 4 / 218
» A Bayesian Approach to Tackling Hard Computational Problems
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Belief theoretic methods for soft and hard data fusion
In many contexts, one is confronted with the problem of extracting information from large amounts of different types soft data (e.g., text) and hard data (from e.g., physics-based...
Thanuka Wickramarathne, Kamal Premaratne, Manohar ...
CORR
2012
Springer
210views Education» more  CORR 2012»
12 years 3 months ago
Fast MCMC sampling for Markov jump processes and continuous time Bayesian networks
Markov jump processes and continuous time Bayesian networks are important classes of continuous time dynamical systems. In this paper, we tackle the problem of inferring unobserve...
Vinayak Rao, Yee Whye Teh
SAINT
2003
IEEE
14 years 21 days ago
Planning For Web Services the Hard Way
In this paper we outline a framework for performing automated discovery, composition and execution of web services based solely on the information available in interface descripti...
Mark James Carman, Luciano Serafini
BMVC
2000
13 years 8 months ago
Parallel Chains, Delayed Rejection and Reversible Jump MCMC for Object Recognition
We tackle the problem of object recognition using a Bayesian approach. A marked point process [1] is used as a prior model for the (unknown number of) objects. A sample is generat...
M. Harkness, P. Green
CORR
2004
Springer
95views Education» more  CORR 2004»
13 years 7 months ago
A New Approach to Draw Detection by Move Repetition in Computer Chess Programming
: We will try to tackle both the theoretical and practical aspects of a very important problem in chess programming as stated in the title of this article
Vladan Vuckovic, Djordje Vidanovic