3894 search results - page 435 / 779 » Approximation Algorithms for Biclustering Problems |
134
click to vote
ISSAC
2009
Springer
15 years 11 months ago
2009
Springer
We describe a new LLL-type algorithm, H-LLL, that relies on Householder transformations to approximate the underlying Gram-Schmidt orthogonalizations. The latter computations are ...
143
Voted
INFOCOM
2000
IEEE
15 years 9 months ago
2000
IEEE
Abstract—We study a network model in which each network link is associated with a set of delays and costs. These costs are a function of the delays and reflect the prices paid i...
112
Voted
ISICA
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. MOEA/D is a novel and successful Multi-Objective Evolutionary Algorithms(MOEA) which utilizes the idea of problem decomposition to tackle the complexity from multiple obj...
130
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
This work considers the problem of designing optimal multi-agent trajectories to patrol an environment. As performance criterion for optimal patrolling we consider the worst-case t...
169
click to vote
KDD
2012
ACM
13 years 7 months ago
2012
ACM
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...