Sciweavers

6110 search results - page 1086 / 1222
» Approximate Computing
Sort
View
AIPS
2010
15 years 8 months ago
When Policies Can Be Trusted: Analyzing a Criteria to Identify Optimal Policies in MDPs with Unknown Model Parameters
Computing a good policy in stochastic uncertain environments with unknown dynamics and reward model parameters is a challenging task. In a number of domains, ranging from space ro...
Emma Brunskill
RECOMB
2010
Springer
15 years 8 months ago
naiveBayesCall: An Efficient Model-Based Base-Calling Algorithm for High-Throughput Sequencing
Immense amounts of raw instrument data (i.e., images of fluorescence) are currently being generated using ultra high-throughput sequencing platforms. An important computational cha...
Wei-Chun Kao, Yun S. Song
ICCV
2007
IEEE
15 years 8 months ago
Ten-fold Improvement in Visual Odometry Using Landmark Matching
Our goal is to create a visual odometry system for robots and wearable systems such that localization accuracies of centimeters can be obtained for hundreds of meters of distance ...
Zhiwei Zhu, Taragay Oskiper, Supun Samarasekera, R...
CORR
2010
Springer
141views Education» more  CORR 2010»
15 years 6 months ago
The Equivalence of Sampling and Searching
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
Scott Aaronson
AI
2006
Springer
15 years 6 months ago
Constraint-based optimization and utility elicitation using the minimax decision criterion
In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which multiple users have distinct preferences. However, making su...
Craig Boutilier, Relu Patrascu, Pascal Poupart, Da...
« Prev « First page 1086 / 1222 Last » Next »