Sciweavers

6110 search results - page 291 / 1222
» Approximate Computing
Sort
View
ICML
2007
IEEE
16 years 7 months ago
Efficiently computing minimax expected-size confidence regions
Given observed data and a collection of parameterized candidate models, a 1- confidence region in parameter space provides useful insight as to those models which are a good fit t...
Brent Bryan, H. Brendan McMahan, Chad M. Schafer, ...
IEEEICCI
2005
IEEE
16 years 7 days ago
A brain-like computer for cognitive software applications: the Ersatz Brain project
We want to design a suitable computer for the efficient execution of the software now being developed that will display human-like cognitive abilities. Examples of these potential...
J. A. Anderson
ANOR
2006
59views more  ANOR 2006»
15 years 6 months ago
The empirical behavior of sampling methods for stochastic programming
Abstract. We investigate the quality of solutions obtained from sample-average approximations to two-stage stochastic linear programs with recourse. We use a recently developed sof...
Jeff Linderoth, Alexander Shapiro, Stephen Wright
CVPR
2012
IEEE
13 years 9 months ago
Computing nearest-neighbor fields via Propagation-Assisted KD-Trees
Matching patches between two images, also known as computing nearest-neighbor fields, has been proven a useful technique in various computer vision/graphics algorithms. But this ...
Kaiming He, Jian Sun
COCOON
2007
Springer
16 years 25 days ago
Streaming Algorithms Measured in Terms of the Computed Quantity
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
Shengyu Zhang