548 search results - page 91 / 110 » Global value numbering using random interpretation |
101
click to vote
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
121
click to vote
CIAC
1994
Springer
15 years 3 months ago
1994
Springer
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
HIPEAC
2009
Springer
15 years 3 months ago
2009
Springer
Abstract. Exposing more instruction-level parallelism in out-of-order superscalar processors requires increasing the number of dynamic in-flight instructions. However, large instru...
104
click to vote
CTRSA
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. Known compact e-cash schemes are constructed from signature schemes with efficient protocols and verifiable random functions. In this paper, we introduce a different ap...
AHSWN
2008
14 years 12 months ago
2008
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...