Sciweavers

336 search results - page 25 / 68
» Effective Randomness for Computable Probability Measures
Sort
View
DAC
2002
ACM
14 years 8 months ago
A general probabilistic framework for worst case timing analysis
CT The traditional approach to worst-case static-timing analysis is becoming unacceptably conservative due to an ever-increasing number of circuit and process effects. We propose a...
Michael Orshansky, Kurt Keutzer
GECCO
2007
Springer
144views Optimization» more  GECCO 2007»
13 years 11 months ago
The reliability of confidence intervals for computational effort comparisons
This paper analyses the reliability of confidence intervals for Koza's computational effort statistic. First, we conclude that dependence between the observed minimum generat...
Matthew Walker, Howard Edwards, Chris H. Messom
ESA
2006
Springer
106views Algorithms» more  ESA 2006»
13 years 11 months ago
Less Hashing, Same Performance: Building a Better Bloom Filter
A standard technique from the hashing literature is to use two hash functions h1(x) and h2(x) to simulate additional hash functions of the form gi(x) = h1(x) + ih2(x). We demonstra...
Adam Kirsch, Michael Mitzenmacher
ICDE
2007
IEEE
157views Database» more  ICDE 2007»
14 years 9 months ago
Object Distinction: Distinguishing Objects with Identical Names
Different people or objects may share identical names in the real world, which causes confusion in many applications. It is a nontrivial task to distinguish those objects, especia...
Xiaoxin Yin, Jiawei Han, Philip S. Yu
JUCS
2006
114views more  JUCS 2006»
13 years 7 months ago
Pseudorandom Number Generation: Impossibility and Compromise
Abstract: Pseudorandom number generators are widely used in the area of simulation. Defective generators are still widely used in standard library programs, although better pseudor...
Makoto Matsumoto, Mutsuo Saito, Hiroshi Haramoto, ...