3096 search results - page 135 / 620 » The Generalized FITC Approximation |
139
click to vote
DOLAP
2005
ACM
15 years 5 months ago
2005
ACM
A novel framework for providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP is presented in this paper. Such a framework allows u...
104
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. We consider approximating the minmax value of a multiplayer game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with...
134
click to vote
AMAI
2006
Springer
15 years 3 months ago
2006
Springer
A weakness of classical Markov decision processes (MDPs) is that they scale very poorly due to the flat state-space representation. Factored MDPs address this representational pro...
116
click to vote
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
Belief Propagation (BP) can be very useful and efficient for performing approximate inference on graphs. But when the graph is very highly connected with strong conflicting intera...
110
click to vote
DAC
2005
ACM
16 years 4 months ago
2005
ACM
System-level design methods specifically targeted towards multimedia applications have recently received a lot of attention. Multimedia workloads are known to have a high degree o...