7015 search results - page 54 / 1403 » Approximation algorithms for co-clustering |
CG
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. A one-player, finite, probabilistic game with perfect information can be presented as a bipartite graph. For one-player Can't Stop, the graph is cyclic and the chall...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
ABSTRACT. In this paper modified variants of the sparse Fourier transform algorithms from [14] are presented which improve on the approximation error bounds of the original algorit...
117
click to vote
FOCS
2007
IEEE
15 years 6 months ago
2007
IEEE
We show that any deterministic data-stream algorithm that makes a constant number of passes over the input and gives a constant factor approximation of the length of the longest i...
AAAI
2008
15 years 2 months ago
2008
Compilation is an important approach to a range of inference problems, since it enables linear-time inference in the size S of the compiled representation. However, the main drawb...
ICRA
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract— We report our algorithmic development of the pframe problem that addresses the need of coordinating a set of p networked robotic pan-tilt-zoom cameras for n, (n > p)...