Sciweavers

4860 search results - page 175 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
NIPS
2007
13 years 11 months ago
What makes some POMDP problems easy to approximate?
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
David Hsu, Wee Sun Lee, Nan Rong
JC
2007
101views more  JC 2007»
13 years 10 months ago
Simple Monte Carlo and the Metropolis algorithm
We study the integration of functions with respect to an unknown density. Information is available as oracle calls to the integrand and to the nonnormalized density function. We ar...
Peter Mathé, Erich Novak
ICALP
2000
Springer
14 years 1 months ago
An Optimal Minimum Spanning Tree Algorithm
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
Seth Pettie, Vijaya Ramachandran
ICCBR
2007
Springer
14 years 2 months ago
When Similar Problems Don't Have Similar Solutions
The performance of a Case-Based Reasoning system relies on the integrity of its case base but in real life applications the available data used to construct the case base invariabl...
Stewart Massie, Susan Craw, Nirmalie Wiratunga
ICASSP
2011
IEEE
13 years 2 months ago
Particle algorithms for filtering in high dimensional state spaces: A case study in group object tracking
We briefly present the current state-of-the-art approaches for group and extended object tracking with an emphasis on particle methods which have high potential to handle complex...
Lyudmila Mihaylova, Avishy Carmi