Sciweavers

534 search results - page 27 / 107
» One more bit is enough
Sort
View
ICFP
2007
ACM
15 years 9 months ago
Faster laziness using dynamic pointer tagging
In the light of evidence that Haskell programs compiled by GHC exhibit large numbers of mispredicted branches on modern processors, we re-examine the "tagless" aspect of...
Simon Marlow, Alexey Rodriguez Yakushev, Simon L. ...
108
Voted
WWW
2011
ACM
14 years 4 months ago
Network bucket testing
Bucket testing, also known as A/B testing, is a practice that is widely used by on-line sites with large audiences: in a simple version of the methodology, one evaluates a new fea...
Lars Backstrom, Jon M. Kleinberg
CHES
2009
Springer
150views Cryptology» more  CHES 2009»
15 years 10 months ago
An Efficient Method for Random Delay Generation in Embedded Software
Random delays are a countermeasure against a range of side channel and fault attacks that is often implemented in embedded software. We propose a new method for generation of rando...
Ilya Kizhvatov, Jean-Sébastien Coron
IFIP
2007
Springer
15 years 3 months ago
A Novel Loop-Free IP Fast Reroute Algorithm
Although providing reliable network services is getting more and more important, currently used methods in IP networks are typically reactive and error correcting can take a long t...
Gábor Enyedi, Gábor Rétv&aacu...
MST
2006
105views more  MST 2006»
14 years 9 months ago
Selection Functions that Do Not Preserve Normality
The sequence selected from a sequence R(0)R(1) . . . by a language L is the subsequence of R that contains exactly the bits R(n + 1) such that the prefix R(0) . . . R(n) is in L. B...
Wolfgang Merkle, Jan Reimann