COMPENG
2010
13 years 10 months ago
2010
ATAL
2010
Springer
13 years 10 months ago
2010
Springer
PAC-MDP algorithms approach the exploration-exploitation problem of reinforcement learning agents in an effective way which guarantees that with high probability, the algorithm pe...
ATAL
2010
Springer
13 years 10 months ago
2010
Springer
Distributed Constraints Optimization (DCOP) is a powerful framework for representing and solving distributed combinatorial problems, where the variables of the problem are owned b...
APPROX
2010
Springer
13 years 10 months ago
2010
Springer
We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the f...
APPROX
2010
Springer
13 years 10 months ago
2010
Springer
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hy...
APPROX
2010
Springer
13 years 10 months ago
2010
Springer
In this paper we consider the reconstruction problem on the tree for the hardcore model. We determine new bounds for the non-reconstruction regime on the k-regular tree showing non...
APPROX
2010
Springer
13 years 10 months ago
2010
Springer
We introduce a new problem in the study of doubling spaces: Given a point set S and a target dimension d , remove from S the fewest number of points so that the remaining set has d...
APPROX
2010
Springer
13 years 10 months ago
2010
Springer
We show that for every n-dimensional lattice L the torus Rn /L can be embedded with distortion O(n
DIALM
2010
ACM
13 years 10 months ago
2010
ACM
GECCO
2008
Springer
13 years 11 months ago
2008
Springer
Selective sampling is a form of active learning which can reduce the cost of training by only drawing informative data points into the training set. This selected training set is ...