4112 search results - page 23 / 823 » Efficient Algorithms for the Spoonerism Problem |
124
click to vote
ESA
2008
Springer
15 years 3 months ago
2008
Springer
For a set P of n points in R2 , the Euclidean 2-center problem computes a pair of congruent disks of the minimal radius that cover P. We extend this to the (2, k)-center problem wh...
121
Voted
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
We present a series of results providing evidence that the incentive problem with VCG-based mechanisms is not very severe. Our first result uses average-case analysis to show that ...
104
click to vote
DAC
2010
ACM
15 years 3 months ago
2010
ACM
Vectorless power grid verification makes it possible to evaluate worst-case voltage drops without enumerating possible current waveforms. Under linear current constraints, the vec...
105
click to vote
ALGORITHMICA
2006
15 years 1 months ago
2006
We study the problem of computing the k maximum sum subsequences. Given a sequence of real numbers x1, x2, . . . , xn and an integer parameter k, 1 k 1 2 n(n - 1), the problem in...
117
Voted
ESA
2000
Springer
15 years 5 months ago
2000
Springer
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...