7015 search results - page 335 / 1403 » Approximation algorithms for co-clustering |
180
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
Interactive dynamic influence diagrams (I-DIDs) are graphical models for sequential decision making in uncertain settings shared by other agents. Algorithms for solving I-DIDs fac...
200
click to vote
CIKM
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we propose an approach for efficient approximative RkNN search in arbitrary metric spaces where the value of k is specified at query time. Our method uses an approx...
200
click to vote
DCOSS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We propose a distributed scheme called Adaptive-GroupMerge for sensor networks that, given a parameter k, approximates a geometric shape by a k-vertex polygon. The algori...
183
click to vote
DAWAK
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...
175
click to vote
ESANN
2004
15 years 8 months ago
2004
Several reinforcement-learning techniques have already been applied to the Acrobot control problem, using linear function approximators to estimate the value function. In this pape...