4541 search results - page 360 / 909 » Cache-Oblivious Algorithms and Data Structures |
146
click to vote
OTM
2005
Springer
15 years 10 months ago
2005
Springer
The strong dynamics of peer-to-peer networks, coupled with the diversity of peer vocabularies, makes query processing in peer database systems a very challenging task. In this pape...
149
click to vote
BICOB
2010
Springer
15 years 9 months ago
2010
Springer
Molecular dynamics simulations have been employed by biologists to study the protein folding problem. Such simulations have resulted in a large number of protein folding trajector...
140
click to vote
BMCBI
2006
15 years 4 months ago
2006
Background: Benchmarking algorithms in structural bioinformatics often involves the construction of datasets of proteins with given sequence and structural properties. The SCOP da...
165
click to vote
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
— Finding decompositions of a graph into a family of clusters is crucial to understanding its underlying structure. While most existing approaches focus on partitioning the nodes...
159
click to vote
INFOVIS
2002
IEEE
15 years 9 months ago
2002
IEEE
Beamtrees are a new method for the visualization of large hierarchical data sets. Nodes are shown as stacked circular beams, such that both the hierarchical structure as well as t...