752 search results - page 96 / 151 » Faster approximation algorithms for the minimum latency prob... |
140
click to vote
ISMIR
2005
Springer
15 years 9 months ago
2005
Springer
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...
129
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
143
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
—Dual descent methods are commonly used to solve network optimization problems because their implementation can be distributed through the network. However, their convergence rat...
143
Voted
SIGECOM
2008
ACM
15 years 3 months ago
2008
ACM
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...
110
click to vote
ISCAS
2003
IEEE
15 years 8 months ago
2003
IEEE
Switching activity is one of the most important factors in power dissipation. This paper studies the scheduling problem that minimizes both schedule length and switching activitie...