Sciweavers

6897 search results - page 502 / 1380
» Parallelization of Modular Algorithms
Sort
View
STOC
2005
ACM
103views Algorithms» more  STOC 2005»
16 years 5 months ago
New and improved constructions of non-malleable cryptographic protocols
We present a new constant round protocol for non-malleable zero-knowledge. Using this protocol as a subroutine, we obtain a new constant-round protocol for non-malleable commitmen...
Rafael Pass, Alon Rosen
OSDI
2008
ACM
16 years 5 months ago
Hunting for Problems with Artemis
Artemis is a modular application designed for analyzing and troubleshooting the performance of large clusters running datacenter services. Artemis is composed of four modules: (1)...
Gabriela F. Cretu-Ciocarlie, Mihai Budiu, Mois&eac...
WAW
2009
Springer
138views Algorithms» more  WAW 2009»
15 years 11 months ago
Information Theoretic Comparison of Stochastic Graph Models: Some Experiments
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
Kevin J. Lang
GECCO
2005
Springer
115views Optimization» more  GECCO 2005»
15 years 10 months ago
A generator for hierarchical problems
We describe a generator for hierarchical problems called the Hierarchical Problem Generator (HPG). Hierarchical problems are of interest since they constitute a class of problems ...
Edwin D. de Jong, Richard A. Watson, Dirk Thierens
VLDB
2005
ACM
125views Database» more  VLDB 2005»
15 years 10 months ago
Using Association Rules for Fraud Detection in Web Advertising Networks
Discovering associations between elements occurring in a stream is applicable in numerous applications, including predictive caching and fraud detection. These applications requir...
Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi