3049 search results - page 277 / 610 » On the Convergence of Bound Optimization Algorithms |
177
click to vote
ISLPED
2007
ACM
15 years 8 months ago
2007
ACM
We address power minimization of earliest deadline first and ratemonotonic schedules by voltage and frequency scaling. We prove that the problems are NP-hard, and present (1+ ) f...
180
click to vote
AAAI
2006
15 years 8 months ago
2006
Learning application-specific distance metrics from labeled data is critical for both statistical classification and information retrieval. Most of the earlier work in this area h...
259
click to vote
PARLE
1994
15 years 10 months ago
1994
Sparse matrix-vector multiplication forms the heart of iterative linear solvers used widely in scientific computations (e.g., finite element methods). In such solvers, the matrix-v...
166
click to vote
IVC
2007
15 years 6 months ago
2007
Recently, an optimization approach for fast visual tracking of articulated structures based on Stochastic Meta-Descent (SMD) [7] has been presented. SMD is a gradient descent with...
181
click to vote
TCOM
2010
15 years 5 months ago
2010
—The optimal performance-complexity tradeoff for error-correcting codes at rates strictly below the Shannon limit is a central question in coding theory. This paper proposes a nu...