54 search results - page 6 / 11 » Fast Bounds on the Distribution of Smooth Numbers |
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
This paper shows how to build and maintain a distributed heap which we call SHELL. In contrast to standard heaps, our heap is oblivious in the sense that its structure only depends...
NIPS
1994
13 years 8 months ago
1994
The performance of on-line algorithms for learning dichotomies is studied. In on-line learning, the number of examples P is equivalent to the learning time, since each example is ...
TPDS
1998
13 years 7 months ago
1998
—A bus oriented network where there is a charge for the amount of divisible load processed on each processor is investigated. A cost optimal processor sequencing result is found ...
TWC
2010
13 years 2 months ago
2010
Relay selection for cooperative communications promises significant performance improvements, and is, therefore, attracting, considerable attention. While several criteria have be...
HPCA
2009
IEEE
14 years 8 months ago
2009
IEEE
The verification of an execution against memory consistency is known to be NP-hard. This paper proposes a novel fast memory consistency verification method by identifying a new na...