780 search results - page 50 / 156 » Cost-Sharing Approximations for h |
ICDT
2010
ACM
15 years 3 months ago
2010
ACM
Given a database instance and a corresponding view instance, we address the view definitions problem (VDP): Find the most succinct and accurate view definition, when the view quer...
AAAI
2007
15 years 1 months ago
2007
In normal scenarios, computer scientists often consider the number of states in a game to capture the difficulty of learning an equilibrium. However, players do not see games in ...
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
In reinforcement learning, least-squares temporal difference methods (e.g., LSTD and LSPI) are effective, data-efficient techniques for policy evaluation and control with linear v...
COMPGEOM
2005
ACM
15 years 1 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
122
click to vote
TOG
2008
14 years 11 months ago
2008
We present a method for interactive computation of indirect illumination in large and fully dynamic scenes based on approximate visibility queries. While the high-frequency nature...