Sciweavers

3096 search results - page 104 / 620
» The Generalized FITC Approximation
Sort
View
TC
2011
13 years 3 months ago
Exact and Approximated Error of the FMA
Abstract—The fused multiply accumulate-add (FMA) instruction, specified by the IEEE 754-2008 Standard for Floating-Point Arithmetic, eases some calculations, and is already avai...
Sylvie Boldo, Jean-Michel Muller
PODS
2008
ACM
159views Database» more  PODS 2008»
14 years 9 months ago
Approximation algorithms for clustering uncertain data
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
Graham Cormode, Andrew McGregor
CDC
2010
IEEE
160views Control Systems» more  CDC 2010»
13 years 3 months ago
Adaptive bases for Q-learning
Abstract-- We consider reinforcement learning, and in particular, the Q-learning algorithm in large state and action spaces. In order to cope with the size of the spaces, a functio...
Dotan Di Castro, Shie Mannor
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
13 years 8 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Mihir Bellare, Oded Goldreich, Madhu Sudan
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
13 years 10 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan