740 search results - page 78 / 148 » An approximation ratio for biclustering |
162
click to vote
TALG
2010
15 years 4 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...
154
click to vote
TCS
2010
15 years 4 months ago
2010
Borodin, Nielsen and Rackoff [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms. In this paper we address the effe...
210
click to vote
OL
2011
15 years 1 months ago
2011
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
100
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
The cross ambiguity function (CAF) arises in many areas such as radar/sonar and communications when correlation processing is performed in the presence of a Doppler frequency shif...
271
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
Skyline computation has many applications including multi-criteria decision making. In this paper, we study the problem of selecting k skyline points so that the number of points,...