11213 search results - page 248 / 2243 » Low-contention data structures |
177
click to vote
INFORMATICALT
2007
15 years 5 months ago
2007
The paper presents, first, the Structural Blanks (SB) approach, then a method to compose loop programs. SB is an approach for expressing computations based on recurrence relations...
156
click to vote
BMCBI
2008
15 years 5 months ago
2008
Background: The fast growing Protein Data Bank contains the three-dimensional description of more than 45000 protein- and nucleic-acid structures today. The large majority of the ...
161
click to vote
KDD
2006
ACM
16 years 5 months ago
2006
ACM
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
143
click to vote
DASFAA
2008
IEEE
15 years 12 months ago
2008
IEEE
Applications demanding multidimensional index structures for performing efficient similarity queries often involve a large amount of data. The conventional tuple-loading approach t...
159
click to vote
ICML
2007
IEEE
16 years 6 months ago
2007
IEEE
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...