740 search results - page 13 / 148 » An approximation ratio for biclustering |
197
click to vote
INFOCOM
2012
IEEE
12 years 12 months ago
2012
IEEE
—When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the fie...
77
Voted
AAIM
2007
Springer
15 years 3 months ago
2007
Springer
The disc covering problem asks to cover a set of points on the plane with a minimum number of fix-sized discs. We develop an O(n(log n)2 (log log n)2 ) deterministic time 2.8334-a...
183
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
This paper presents the first theoretical study, on using local-recoding generalization (LRG) to compute a kanonymous table with quality guarantee. First, we prove that it is NP-h...
64
Voted
DAM
2006
14 years 9 months ago
2006
Let P be a combinatorial optimization problem, and let A be an approximation algorithm for P. The domination ratio domr(A, s) is the maximal real q such that the solution x(I) obt...
192
Voted
ICDE
2012
IEEE
12 years 12 months ago
2012
IEEE
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...