7015 search results - page 46 / 1403 » Approximation algorithms for co-clustering |
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
STOC
1989
ACM
14 years 1 months ago
1989
ACM
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...
ESA
2009
Springer
14 years 3 months ago
2009
Springer
In this paper we consider both the maximization variant Max Rep and the minimization variant Min Rep of the famous Label Cover problem, for which, till now, the best approximation ...
ICIP
2007
IEEE
14 years 3 months ago
2007
IEEE
Practical sparse approximation algorithms (particularly greedy algorithms) suffer two significant drawbacks: they are difficult to implement in hardware, and they are inefficie...
SECON
2007
IEEE
14 years 3 months ago
2007
IEEE
Base station location has significant impact on network lifetime performance for a sensor network. For a multihop sensor network, this problem is particular challenging as we need ...