1449 search results - page 108 / 290 » Self-Randomized Exponentiation Algorithms |
153
click to vote
WADS
2007
Springer
16 years 12 days ago
2007
Springer
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...
152
click to vote
WISA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. The algorithm proposed by Ha and Moon [2] is a countermeasure against power analysis. The Ha-Moon algorithm has two drawbacks in that it requires an inversion and has a r...
157
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in ...
178
click to vote
SSDBM
2007
IEEE
16 years 17 days ago
2007
IEEE
We present a fast algorithm for computing approximate quantiles in high speed data streams with deterministic error bounds. For data streams of size N where N is unknown in advanc...
168
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
Recently much research has focused on both the supply chain and reverse logistics network design problem. The rapid progress in computer and network technology and the increasingly...