Sciweavers

6110 search results - page 266 / 1222
» Approximate Computing
Sort
View
PLDI
2010
ACM
15 years 11 months ago
Green: a framework for supporting energy-conscious programming using controlled approximation
Energy-efficient computing is important in several systems ranging from embedded devices to large scale data centers. Several application domains offer the opportunity to tradeof...
Woongki Baek, Trishul M. Chilimbi
IJCV
2006
115views more  IJCV 2006»
15 years 6 months ago
An Analysis of Linear Subspace Approaches for Computer Vision and Pattern Recognition
: Linear subspace analysis (LSA) has become rather ubiquitous in a wide range of problems arising in pattern recognition and computer vision. The essence of these approaches is tha...
Pei Chen, David Suter
TOG
2010
129views more  TOG 2010»
15 years 1 months ago
Optical computing for fast light transport analysis
We present a general framework for analyzing the transport matrix of a real-world scene at full resolution, without capturing many photos. The key idea is to use projectors and ca...
Matthew O'Toole, Kiriakos N. Kutulakos
APPROX
2009
Springer
112views Algorithms» more  APPROX 2009»
16 years 1 months ago
Deterministic Approximation Algorithms for the Nearest Codeword Problem
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
Noga Alon, Rina Panigrahy, Sergey Yekhanin
ATAL
2005
Springer
16 years 4 days ago
Improving reinforcement learning function approximators via neuroevolution
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
Shimon Whiteson