Sciweavers

3341 search results - page 131 / 669
» On Bounded Queries and Approximation
Sort
View
AAAI
2007
15 years 9 days ago
Purely Epistemic Markov Decision Processes
Planning under uncertainty involves two distinct sources of uncertainty: uncertainty about the effects of actions and uncertainty about the current state of the world. The most wi...
Régis Sabbadin, Jérôme Lang, N...
CIKM
2010
Springer
14 years 8 months ago
Combining link and content for collective active learning
In this paper, we study a novel problem Collective Active Learning, in which we aim to select a batch set of "informative" instances from a networking data set to query ...
Lixin Shi, Yuhang Zhao, Jie Tang
COLT
2007
Springer
15 years 4 months ago
A Lower Bound for Agnostically Learning Disjunctions
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
Adam R. Klivans, Alexander A. Sherstov
PODS
2005
ACM
115views Database» more  PODS 2005»
15 years 10 months ago
Histograms revisited: when are histograms the best approximation method for aggregates over joins?
The traditional statistical assumption for interpreting histograms and justifying approximate query processing methods based on them is that all elements in a bucket have the same...
Alin Dobra
ICANNGA
2007
Springer
141views Algorithms» more  ICANNGA 2007»
15 years 4 months ago
Estimates of Approximation Rates by Gaussian Radial-Basis Functions
Rates of approximation by networks with Gaussian RBFs with varying widths are investigated. For certain smooth functions, upper bounds are derived in terms of a Sobolev-equivalent ...
Paul C. Kainen, Vera Kurková, Marcello Sang...