7015 search results - page 422 / 1403 » Approximation algorithms for co-clustering |
183
click to vote
TALG
2010
15 years 5 months ago
2010
We describe an automata-theoretic approach for the competitive analysis of online algorithms. Our approach is based on weighted automata, which assign to each input word a cost in...
185
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
153
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for a...
178
click to vote
IMR
2004
Springer
16 years 6 days ago
2004
Springer
We propose a new two-dimensional meshing algorithm called PINW able to generate meshes that accurately approximate the distance between any two domain points by paths composed onl...
188
click to vote
VMV
2001
15 years 8 months ago
2001
In this paper, we present a theoretical analysis of the error with three basic Monte Carlo radiosity algorithms, based on continuous collision shooting random walks, discrete coll...