Sciweavers

1957 search results - page 50 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
VLDB
2001
ACM
144views Database» more  VLDB 2001»
15 years 10 months ago
Approximate query processing using wavelets
Approximate query processing has emerged as a costeffective approach for dealing with the huge data volumes and stringent response-time requirements of today's decision-suppo...
Kaushik Chakrabarti, Minos N. Garofalakis, Rajeev ...
64
Voted
ICRA
2006
IEEE
85views Robotics» more  ICRA 2006»
15 years 3 months ago
Extended EM for Planar Approximation of 3D Data
– The paper deals with fitting of planar patches to 3D laser range data obtained by a mobile robot. The number and the initial position of the patches are unknown, hence their es...
Rolf Lakämper, Longin Jan Latecki
UAI
1998
14 years 11 months ago
Flexible Decomposition Algorithms for Weakly Coupled Markov Decision Problems
This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method. In these app...
Ronald Parr
70
Voted
AAAI
2007
15 years 19 hour ago
Compact Spectral Bases for Value Function Approximation Using Kronecker Factorization
A new spectral approach to value function approximation has recently been proposed to automatically construct basis functions from samples. Global basis functions called proto-val...
Jeffrey Johns, Sridhar Mahadevan, Chang Wang
CSL
2001
Springer
15 years 2 months ago
A Logic for Approximate First-Order Reasoning
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ï...
Frédéric Koriche