Sciweavers

1017 search results - page 70 / 204
» A General Model for Authenticated Data Structures
Sort
View
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 9 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
KDD
2009
ACM
179views Data Mining» more  KDD 2009»
14 years 3 months ago
Identifying graphs from noisy and incomplete data
There is a growing wealth of data describing networks of various types, including social networks, physical networks such as transportation or communication networks, and biologic...
Galileo Mark S. Namata Jr., Lise Getoor
BMCBI
2011
13 years 11 days ago
GPCR-SSFE: A comprehensive database of G-protein-coupled receptor template predictions and homology models
Background: G protein-coupled receptors (GPCRs) transduce a wide variety of extracellular signals to within the cell and therefore have a key role in regulating cell activity and ...
Catherine L. Worth, Annika Kreuchwig, Gunnar Klein...
USS
2008
13 years 11 months ago
Practical Symmetric Key Cryptography on Modern Graphics Hardware
Graphics processors are continuing their trend of vastly outperforming CPUs while becoming more general purpose. The latest generation of graphics processors have introduced the a...
Owen Harrison, John Waldron
ICANN
2001
Springer
14 years 1 months ago
Independent Variable Group Analysis
Humans tend to group together related properties in order to understand complex phenomena. When modeling large problems with limited representational resources, it is important to...
Krista Lagus, Esa Alhoniemi, Harri Valpola