11213 search results - page 196 / 2243 » Low-contention data structures |
132
click to vote
BMCBI
2006
15 years 4 months ago
2006
Background: The structure of proteins may change as a result of the inherent flexibility of some protein regions. We develop and explore probabilistic machine learning methods for...
159
click to vote
NAR
1998
15 years 4 months ago
1998
The FSSP database and its new supplement, the Dali Domain Dictionary, present a continuously updated classification of all known 3D protein structures. The classification is deriv...
116
click to vote
SAC
2002
ACM
15 years 4 months ago
2002
ACM
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
169
click to vote
TON
2010
14 years 11 months ago
2010
This paper presents Interleaved Stratified Timer Wheels as a novel priority queue data structure for traffic shaping and scheduling in packet-switched networks. The data structure ...
201
click to vote
CORR
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...