7015 search results - page 73 / 1403 » Approximation algorithms for co-clustering |
ICPR
2000
IEEE
14 years 1 months ago
2000
IEEE
For many pattern recognition methods, high recognition accuracy is obtained at very high expense of computational cost. In this paper, a new algorithm that reduces the computation...
ATAL
2008
Springer
13 years 11 months ago
2008
Springer
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs...
ESA
2008
Springer
13 years 11 months ago
2008
Springer
In the relay placement problem the input is a set of sensors and a number r 1, the communication range of a relay. In the one-tier version of the problem the objective is to place...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
ICCAD
2007
IEEE
14 years 6 months ago
2007
IEEE
— The paper addresses the problem of performance optimization for a set of periodic tasks with discrete voltage/frequency states under thermal constraints. We prove that the prob...