234 search results - page 23 / 47 » Randomized splay trees: Theoretical and experimental results |
142
click to vote
ICS
2009
Tsinghua U.
15 years 6 months ago
2009
Tsinghua U.
New static source routing algorithms for High Performance Computing (HPC) are presented in this work. The target parallel architectures are based on the commonly used fattree netw...
ADMA
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Most of the work in Machine Learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
107
click to vote
NIPS
2004
15 years 3 months ago
2004
Go is an ancient oriental game whose complexity has defeated attempts to automate it. We suggest using probability in a Bayesian sense to model the uncertainty arising from the va...
108
click to vote
RECOMB
2005
Springer
16 years 2 months ago
2005
Springer
This paper proposes a novel tree decomposition based side-chain assignment algorithm, which can obtain the globally optimal solution of the side-chain packing problem very efficien...
FGCS
2000
15 years 1 months ago
2000
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...