Sciweavers

368 search results - page 36 / 74
» Advanced Computing and Communications Research under NSF Sup...
Sort
View
105
Voted
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
16 years 1 months ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
87
Voted
KDD
1997
ACM
184views Data Mining» more  KDD 1997»
15 years 4 months ago
JAM: Java Agents for Meta-Learning over Distributed Databases
In this paper, we describe the JAM system, a distributed, scalable and portable agent-based data mining system that employs a general approach to scaling data mining applications ...
Salvatore J. Stolfo, Andreas L. Prodromidis, Shell...
SIGMETRICS
2005
ACM
127views Hardware» more  SIGMETRICS 2005»
15 years 6 months ago
A data streaming algorithm for estimating subpopulation flow size distribution
Statistical information about the flow sizes in the traffic passing through a network link helps a network operator to characterize network resource usage, infer traffic demands,...
Abhishek Kumar, Minho Sung, Jun Xu, Ellen W. Zegur...
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
15 years 4 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
92
Voted
GD
2004
Springer
15 years 5 months ago
Computing Radial Drawings on the Minimum Number of Circles
A radial drawing is a representation of a graph in which the vertices lie on concentric circles of finite radius. In this paper we study the problem of computing radial drawings ...
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta,...