Sciweavers

8294 search results - page 931 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
CORR
2002
Springer
113views Education» more  CORR 2002»
15 years 7 months ago
Robust Global Localization Using Clustered Particle Filtering
Global mobile robot localization is the problem of determining a robot's pose in an environment, using sensor data, when the starting position is unknown. A family of probabi...
Javier Nicolás Sánchez, Adam Milstei...
JMLR
2010
137views more  JMLR 2010»
15 years 2 months ago
Importance Sampling for Continuous Time Bayesian Networks
A continuous time Bayesian network (CTBN) uses a structured representation to describe a dynamic system with a finite number of states which evolves in continuous time. Exact infe...
Yu Fan, Jing Xu, Christian R. Shelton
ACL
2006
15 years 9 months ago
QuestionBank: Creating a Corpus of Parse-Annotated Questions
This paper describes the development of QuestionBank, a corpus of 4000 parseannotated questions for (i) use in training parsers employed in QA, and (ii) evaluation of question par...
John Judge, Aoife Cahill, Josef van Genabith
CVPR
2008
IEEE
16 years 9 months ago
Learning Bayesian Networks with qualitative constraints
Graphical models such as Bayesian Networks (BNs) are being increasingly applied to various computer vision problems. One bottleneck in using BN is that learning the BN model param...
Yan Tong, Qiang Ji
BMCBI
2007
164views more  BMCBI 2007»
15 years 7 months ago
SEARCHPATTOOL: a new method for mining the most specific frequent patterns for binding sites with application to prokaryotic DNA
Background: Computational methods to predict transcription factor binding sites (TFBS) based on exhaustive algorithms are guaranteed to find the best patterns but are often limite...
Fathi Elloumi, Martha Nason