Sciweavers

151 search results - page 24 / 31
» Efficient Skyline Computation over Low-Cardinality Domains
Sort
View
JAIR
2006
160views more  JAIR 2006»
14 years 10 months ago
Anytime Point-Based Approximations for Large POMDPs
The Partially Observable Markov Decision Process has long been recognized as a rich framework for real-world planning and control problems, especially in robotics. However exact s...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
84
Voted
VC
2008
102views more  VC 2008»
14 years 10 months ago
Solving nonlinear polynomial systems in the barycentric Bernstein basis
We present a method for solving arbitrary systems of N nonlinear polynomials in n variables over an n-dimensional simplicial domain based on polynomial representation in the baryce...
Martin Reuter, Tarjei S. Mikkelsen, Evan C. Sherbr...
ICDE
1998
IEEE
187views Database» more  ICDE 1998»
15 years 11 months ago
Mining Optimized Association Rules with Categorical and Numeric Attributes
?Mining association rules on large data sets has received considerable attention in recent years. Association rules are useful for determining correlations between attributes of a ...
Rajeev Rastogi, Kyuseok Shim
VIS
2007
IEEE
183views Visualization» more  VIS 2007»
15 years 11 months ago
Lattice Based Volumetric Global Illumination
We describe a novel volumetric global illumination framework based on the Face-Centered Cubic (FCC) lattice. An FCC lattice has important advantages over a Cartesian lattice. It ha...
Feng Qiu, Fang Xu, Zhe Fan, Neophytos Neophytou...
ICML
2009
IEEE
15 years 11 months ago
Monte-Carlo simulation balancing
In this paper we introduce the first algorithms for efficiently learning a simulation policy for Monte-Carlo search. Our main idea is to optimise the balance of a simulation polic...
David Silver, Gerald Tesauro