2924 search results - page 184 / 585 » Lower Bounds in Distributed Computing |
126
click to vote
GD
1997
Springer
15 years 7 months ago
1997
Springer
This paper studies 3-D orthogonal grid drawings for graphs of arbitrary degree, in particular Kn, with vertices drawn as boxes. It establishes asymptotic lower bounds for the volu...
100
click to vote
ESA
2003
Springer
15 years 8 months ago
2003
Springer
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
105
click to vote
SPAA
2003
ACM
15 years 8 months ago
2003
ACM
Previous implementations of out-of-core columnsort limit the problem size to N ≤ (M/P)3/2, where N is the number of records to sort, P is the number of processors, and M is the ...
134
click to vote
EUROPAR
2005
Springer
15 years 8 months ago
2005
Springer
— Previous works have shown that neural branch prediction techniques achieve far lower misprediction rate than traditional approaches. We propose a neural predictor based on two ...
122
click to vote
CORR
1999
Springer
15 years 2 months ago
1999
Springer
Solomonoff sequence prediction is a scheme to predict digits of binary strings without knowing the underlying probability distribution. We call a prediction scheme informed when i...