Sciweavers

26354 search results - page 81 / 5271
» How we refactor, and how we know it
Sort
View
FSE
2005
Springer
112views Cryptology» more  FSE 2005»
14 years 2 months ago
How to Maximize Software Performance of Symmetric Primitives on Pentium III and 4 Processors
Abstract. This paper discusses the state-of-the-art software optimization methodology for symmetric cryptographic primitives on Pentium III and 4 processors. We aim at maximizing s...
Mitsuru Matsui, Sayaka Fukuda
CP
2004
Springer
14 years 2 months ago
How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
Haixia Jia, Cristopher Moore
DEXAW
2003
IEEE
76views Database» more  DEXAW 2003»
14 years 2 months ago
Today's DBMSs: How autonomic are they?
Database Management Systems (DBMSs) are complex systems whose manageability is increasingly becoming a real concern. Realizing that expert Database Administrators (DBAs) are scarc...
Said Elnaffar, Wendy Powley, Darcy G. Benoit, T. P...
MIDDLEWARE
2009
Springer
14 years 1 months ago
How to Keep Your Head above Water While Detecting Errors
Today’s distributed systems need runtime error detection to catch errors arising from software bugs, hardware errors, or unexpected operating conditions. A prominent class of err...
Ignacio Laguna, Fahad A. Arshad, David M. Grothe, ...
COCO
2006
Springer
100views Algorithms» more  COCO 2006»
14 years 25 days ago
How to Get More Mileage from Randomness Extractors
Let C be a class of distributions over {0, 1}n . A deterministic randomness extractor for C is a function E : {0, 1}n {0, 1}m such that for any X in C the distribution E(X) is sta...
Ronen Shaltiel