Sciweavers

587 search results - page 68 / 118
» On the Relative Sizes of Learnable Sets
Sort
View
PKDD
2010
Springer
235views Data Mining» more  PKDD 2010»
13 years 6 months ago
Online Structural Graph Clustering Using Frequent Subgraph Mining
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
Madeleine Seeland, Tobias Girschick, Fabian Buchwa...
ASIACRYPT
2003
Springer
14 years 2 months ago
Sequential Key Derivation Patterns for Broadcast Encryption and Key Predistribution Schemes
Abstract. We study two closely related primitives: Broadcast Encryption and Key Predistribution Schemes (KPS). Broadcast Encryption allows a broadcaster to broadcast an encrypted m...
Nuttapong Attrapadung, Kazukuni Kobara, Hideki Ima...
APLAS
2007
ACM
14 years 23 days ago
Scalable Simulation of Cellular Signaling Networks
Abstract. Given the combinatorial nature of cellular signalling pathways, where biological agents can bind and modify each other in a large number of ways, concurrent or agent-base...
Vincent Danos, Jérôme Feret, Walter F...
FAST
2010
13 years 11 months ago
Bimodal Content Defined Chunking for Backup Streams
Data deduplication has become a popular technology for reducing the amount of storage space necessary for backup and archival data. Content defined chunking (CDC) techniques are w...
Erik Kruus, Cristian Ungureanu, Cezary Dubnicki
VISUALIZATION
2003
IEEE
14 years 2 months ago
Hierarchical Splatting of Scattered Data
Numerical particle simulations and astronomical observations create huge data sets containing uncorrelated 3D points of varying size. These data sets cannot be visualized interact...
Matthias Hopf, Thomas Ertl