575 search results - page 87 / 115 » Computing Maximum Subsequence in Parallel |
SPAA
2005
ACM
14 years 2 months ago
2005
ACM
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
IPPS
2010
IEEE
13 years 6 months ago
2010
IEEE
We consider the problem of broadcasting a large message in a large scale distributed platform. The message must be sent from a source node, with the help of the receiving peers whi...
CRYPTO
2004
Springer
14 years 2 months ago
2004
Springer
We study both distinguishing and key-recovery attacks against E0, the keystream generator used in Bluetooth by means of correlation. First, a powerful computation method of correla...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Algorithmic pricing is the computational problem that sellers (e.g., in supermarkets) face when trying to set prices for their items to maximize their profit in the presence of a ...
ICCAD
2009
IEEE
13 years 6 months ago
2009
IEEE
The flip-chip package is introduced for modern IC designs with higher integration density and larger I/O counts. In this paper, we consider the pre-assignment flip-chip routing pr...