Sciweavers

1017 search results - page 124 / 204
» A General Model for Authenticated Data Structures
Sort
View
KDD
2007
ACM
168views Data Mining» more  KDD 2007»
14 years 9 months ago
Finding tribes: identifying close-knit individuals from employment patterns
We present a family of algorithms to uncover tribes--groups of individuals who share unusual sequences of affiliations. While much work inferring community structure describes lar...
Lisa Friedland, David Jensen
ICALP
2005
Springer
14 years 2 months ago
Spatial Logics for Bigraphs
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place...
Giovanni Conforti, Damiano Macedonio, Vladimiro Sa...
NAR
2007
90views more  NAR 2007»
13 years 8 months ago
The SUPERFAMILY database in 2007: families and functions
The SUPERFAMILY database provides protein domain assignments, at the SCOP ‘superfamily’ level, for the predicted protein sequences in over 400 completed genomes. A superfamily...
Derek Wilson, Martin Madera, Christine Vogel, Cyru...
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 9 months ago
Network Inference from Co-Occurrences
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
Michael Rabbat, Mário A. T. Figueiredo, Rob...
ASPLOS
2011
ACM
13 years 16 days ago
NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...
Joel Coburn, Adrian M. Caulfield, Ameen Akel, Laur...