Sciweavers

2376 search results - page 266 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
ICML
1996
IEEE
14 years 10 months ago
Passive Distance Learning for Robot Navigation
Autonomous mobile robots need good models of their environment, sensors and actuators to navigate reliably and efficiently. While this information can be supplied by humans, or le...
Sven Koenig, Reid G. Simmons
ISBI
2006
IEEE
14 years 10 months ago
Fast regularized reconstruction of non-uniformly subsampled parallel MRI data
Parallel MR imaging is an effective approach to reduce MR image acquisition time. Non-uniform subsampling allows one to tailor the subsampling scheme for improved image quality at...
William Scott Hoge, Misha Elena Kilmer, Steven Hak...
ICDT
2009
ACM
109views Database» more  ICDT 2009»
14 years 10 months ago
TOP-K projection queries for probabilistic business processes
A Business Process (BP) consists of some business activities undertaken by one or more organizations in pursuit of some business goal. Tools for querying and analyzing BP specific...
Daniel Deutch, Tova Milo
WWW
2009
ACM
14 years 10 months ago
Fast dynamic reranking in large graphs
In this paper we consider the problem of re-ranking search results by incorporating user feedback. We present a graph theoretic measure for discriminating irrelevant results from ...
Purnamrita Sarkar, Andrew W. Moore
STOC
2009
ACM
91views Algorithms» more  STOC 2009»
14 years 10 months ago
Inaccessible entropy
We put forth a new computational notion of entropy, which measures the (in)feasibility of sampling high entropy strings that are consistent with a given protocol. Specifically, we...
Iftach Haitner, Omer Reingold, Salil P. Vadhan, Ho...