7015 search results - page 332 / 1403 » Approximation algorithms for co-clustering |
161
click to vote
IJAR
2006
15 years 6 months ago
2006
Although influence diagrams are powerful tools for representing and solving complex decisionmaking problems, their evaluation may require an enormous computational effort and this...
178
click to vote
ML
2002
ACM
15 years 6 months ago
2002
ACM
TD() is a popular family of algorithms for approximate policy evaluation in large MDPs. TD() works by incrementally updating the value function after each observed transition. It h...
191
click to vote
IPL
2008
15 years 6 months ago
2008
We consider the problem of computing shortest paths in three-dimensions in the presence of a single-obstacle polyhedral terrain, and present a new algorithm that for any p 1, comp...
158
click to vote
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
We present efficient approximation algorithms for finding Nash equilibria in anonymous games, that is, games in which the players utilities, though different, do not differentia...
198
click to vote
COMPGEOM
2004
ACM
16 years 4 days ago
2004
ACM
We present memory-efficient deterministic algorithms for constructing -nets and -approximations of streams of geometric data. Unlike probabilistic approaches, these deterministic...