7015 search results - page 219 / 1403 » Approximation algorithms for co-clustering |
161
click to vote
APPROX
2004
Springer
15 years 12 months ago
2004
Springer
We study the problem of minimizing the broadcast time for a set of processors in a cluster, where processor has transmission time , which is the time taken to send a message to any...
169
click to vote
DCC
1993
IEEE
15 years 10 months ago
1993
IEEE
Two new algorithms for performing arithmetic coding without employing multiplication are presented. The first algorithm, suitable for an alphabet of arbitrary size, reduces the wo...
145
click to vote
ATAL
2007
Springer
16 years 21 days ago
2007
Springer
Running several sub-optimal algorithms and choosing the optimal one is a common procedure in computer science, most notably in the design of approximation algorithms. This paper d...
141
click to vote
CSIE
2009
IEEE
15 years 11 months ago
2009
IEEE
A new algorithm of image layer-presentation was proposed. The key concept of the algorithm was in that the image grayscale function f(x,y), which was comparatively irregular, was ...
170
click to vote
ICML
1999
IEEE
16 years 7 months ago
1999
IEEE
Most machine learning algorithms share the following drawback: they only output bare predictions but not the con dence in those predictions. In the 1960s algorithmic information t...