Sciweavers

1435 search results - page 158 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
PKDD
2010
Springer
129views Data Mining» more  PKDD 2010»
14 years 8 months ago
Smarter Sampling in Model-Based Bayesian Reinforcement Learning
Abstract. Bayesian reinforcement learning (RL) is aimed at making more efficient use of data samples, but typically uses significantly more computation. For discrete Markov Decis...
Pablo Samuel Castro, Doina Precup
SECON
2007
IEEE
15 years 4 months ago
Approximation Algorithm for Base Station Placement in Wireless Sensor Networks
Base station location has significant impact on network lifetime performance for a sensor network. For a multihop sensor network, this problem is particular challenging as we need ...
Yi Shi, Yiwei Thomas Hou
JMLR
2006
118views more  JMLR 2006»
14 years 10 months ago
Learning Factor Graphs in Polynomial Time and Sample Complexity
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
Pieter Abbeel, Daphne Koller, Andrew Y. Ng
CORR
2011
Springer
243views Education» more  CORR 2011»
14 years 5 months ago
Localization from Incomplete Noisy Distance Measurements
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
Adel Javanmard, Andrea Montanari
ICPP
1998
IEEE
15 years 2 months ago
Improving Parallel-Disk Buffer Management using Randomized Writeback
We address the problems of I/O scheduling and buffer management for general reference strings in a parallel I/O system. Using the standard parallel disk model withD disks and a sh...
Mahesh Kallahalla, Peter J. Varman