7015 search results - page 184 / 1403 » Approximation algorithms for co-clustering |
124
click to vote
AAAI
2011
14 years 3 months ago
2011
Planning agents often lack the computational resources needed to build full planning trees for their environments. Agent designers commonly overcome this finite-horizon approxima...
178
Voted
STOC
2006
ACM
16 years 3 months ago
2006
ACM
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
158
click to vote
MOBIHOC
2002
ACM
16 years 2 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
143
click to vote
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
129
click to vote
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
Synchronous reinforcement learning (RL) algorithms with linear function approximation are representable as inhomogeneous matrix iterations of a special form (Schoknecht & Merk...