Sciweavers

198 search results - page 23 / 40
» Source Codes as Random Number Generators
Sort
View
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
15 years 10 months ago
Quantitative evaluation of approximate frequent pattern mining algorithms
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...
WCRE
2002
IEEE
15 years 2 months ago
Register Liveness Analysis for Optimizing Dynamic Binary Translation
Dynamic binary translators compile machine code from a source architecture to a target architecture at run time. Due to the hard time constraints of just-in-time compilation only ...
Mark Probst, Andreas Krall, Bernhard Scholz
PPAM
2007
Springer
15 years 3 months ago
Enhancing Productivity in High Performance Computing through Systematic Conditioning
Abstract. In order to take full advantage of high-end computing platforms, scientific applications often require modifications to source codes, and to their build systems that ge...
Magdalena Slawiñska, Jaroslaw Slawinski, Va...
ACSAC
2009
IEEE
15 years 4 months ago
Symmetric Cryptography in Javascript
—We take a systematic approach to developing a symmetric cryptography library in Javascript. We study various strategies for optimizing the code for the Javascript interpreter, a...
Emily Stark, Michael Hamburg, Dan Boneh
ACSC
2006
IEEE
15 years 3 months ago
Throughput fairness in k-ary n-cube networks
The performance of an interconnection network is measured by two metrics: average latency and peak network throughput. Network throughput is the total number of packets delivered ...
Cruz Izu