4886 search results - page 636 / 978 » Approximate Data Exchange |
191
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...
161
click to vote
COMPGEOM
2001
ACM
15 years 10 months ago
2001
ACM
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...
213
click to vote
BDA
2007
15 years 8 months ago
2007
Sharing huge, massively distributed databases in P2P systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer suffi...
197
click to vote
NIPS
2008
15 years 8 months ago
2008
By attempting to simultaneously partition both the rows (examples) and columns (features) of a data matrix, Co-clustering algorithms often demonstrate surprisingly impressive perf...
192
click to vote
UAI
2000
15 years 8 months ago
2000
In this paper we address the problem of learning the structure of a Bayesian network in domains with continuous variables. This task requires a procedure for comparing different c...