7015 search results - page 364 / 1403 » Approximation algorithms for co-clustering |
154
Voted
JUCS
2008
15 years 7 months ago
2008
: We prove the computability of Bloch's constant by presenting the first algorithm approximating the constant up to arbitrary precision. Key Words: computability, algorithm, B...
181
Voted
PAKDD
2005
ACM
16 years 29 days ago
2005
ACM
In many modern application ranges high-dimensional feature vectors are used to model complex real-world objects. Often these objects reside on different local sites. In this paper,...
211
click to vote
AUTOMATICA
2008
15 years 7 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
199
click to vote
JMM2
2007
15 years 7 months ago
2007
—This paper aims to develop a novel framework to systematically trade-off computational complexity with output distortion in linear multimedia transforms, in an optimal manner. T...
288
Voted
VLDB
2001
ACM
16 years 7 months ago
2001
ACM
Approximate query processing has emerged as a costeffective approach for dealing with the huge data volumes and stringent response-time requirements of today's decision-suppo...