Sciweavers

502 search results - page 29 / 101
» Deploying a New Hash Algorithm
Sort
View
ASIACRYPT
2011
Springer
13 years 11 months ago
Short Signatures from Weaker Assumptions
We provide constructions of (m, 1)-programmable hash functions (PHFs) for m ≥ 2. Mimicking certain programmability properties of random oracles, PHFs can, e.g., be plugged into ...
Dennis Hofheinz, Tibor Jager, Eike Kiltz
INFOCOM
2012
IEEE
13 years 2 months ago
The Variable-Increment Counting Bloom Filter
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
Ori Rottenstreich, Yossi Kanizo, Isaac Keslassy
COMPGEOM
1998
ACM
15 years 4 months ago
Matching 2D Patterns of Protein Spots
A new algorithmic approach to comparing 2D patterns of protein spots obtained by the 2D gel electrophoresis technique is presented. Both the matching of a local pattern vs. a full...
Frank Hoffmann, Klaus Kriegel, Carola Wenk
IMC
2003
ACM
15 years 5 months ago
Bitmap algorithms for counting active flows on high speed links
—This paper presents a family of bitmap algorithms that address the problem of counting the number of distinct header patterns (flows) seen on a high-speed link. Such counting c...
Cristian Estan, George Varghese, Mike Fisk
ICS
2009
Tsinghua U.
15 years 6 months ago
Dynamic topology aware load balancing algorithms for molecular dynamics applications
Molecular Dynamics applications enhance our understanding of biological phenomena through bio-molecular simulations. Large-scale parallelization of MD simulations is challenging b...
Abhinav Bhatele, Laxmikant V. Kalé, Sameer ...