Sciweavers

1456 search results - page 155 / 292
» Improved Randomized Results for That Interval Selection Prob...
Sort
View
NIPS
2008
15 years 14 days ago
Resolution Limits of Sparse Coding in High Dimensions
This paper addresses the problem of sparsity pattern detection for unknown ksparse n-dimensional signals observed through m noisy, random linear measurements. Sparsity pattern rec...
Alyson K. Fletcher, Sundeep Rangan, Vivek K. Goyal
DICTA
2003
15 years 12 days ago
Synthesising Textures Using Variable Neighbourhood Searching
Abstract. Texture synthesis aims to define and reproduce discriminating image features. These features are used to associate with and differentiate between two textures. Often tex...
Minh Tran, Amitava Datta
72
Voted
AAAI
2000
15 years 12 days ago
Gridworlds as Testbeds for Planning with Incomplete Information
Gridworlds are popular testbeds for planning with incomplete information but not much is known about their properties. We study a fundamental planning problem, localization, to in...
Craig A. Tovey, Sven Koenig
WSC
1997
15 years 11 days ago
Bayesian Analysis for Simulation Input and Output
The paper summarizes some important results at the intersection of the fields of Bayesian statistics and stochastic simulation. Two statistical analysis issues for stochastic sim...
Stephen E. Chick
SODA
2012
ACM
200views Algorithms» more  SODA 2012»
13 years 1 months ago
The shifting sands algorithm
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...
Andrew McGregor, Paul Valiant