Sciweavers

534 search results - page 15 / 107
» One more bit is enough
Sort
View
LATINCRYPT
2010
13 years 6 months ago
New Software Speed Records for Cryptographic Pairings
Abstract. This paper presents new software speed records for the computation of cryptographic pairings. More specifically, we present details of an implementation which computes t...
Michael Naehrig, Ruben Niederhagen, Peter Schwabe
ICMCS
2010
IEEE
165views Multimedia» more  ICMCS 2010»
13 years 9 months ago
On deriving longer fingerprints from features based on projections
We propose three methods to derive longer fingerprints from features using projection based hashing methods. For this class of hashing methods, a feature matrix is projected onto ...
Regunathan Radhakrishnan, Claus Bauer, Wenyu Jiang
GECCO
2003
Springer
14 years 1 months ago
A Kernighan-Lin Local Improvement Heuristic That Solves Some Hard Problems in Genetic Algorithms
We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...
William A. Greene
ISCA
1998
IEEE
126views Hardware» more  ISCA 1998»
14 years 5 days ago
Switcherland: A QoS Communication Architecture for Workstation Clusters
Computer systems have become powerful enough to process continuous data streams such as video or animated graphics. While processing power and communication bandwidth of today...
Hans Eberle, Erwin Oertli
BMCBI
2010
120views more  BMCBI 2010»
13 years 8 months ago
Short clones or long clones? A simulation study on the use of paired reads in metagenomics
Background: Metagenomics is the study of environmental samples using sequencing. Rapid advances in sequencing technology are fueling a vast increase in the number and scope of met...
Suparna Mitra, Max Schubach, Daniel H. Huson