Sciweavers

2661 search results - page 450 / 533
» Quantum Complexity Classes
Sort
View
103
Voted
HPCA
2007
IEEE
16 years 1 months ago
MemTracker: Efficient and Programmable Support for Memory Access Monitoring and Debugging
Memory bugs are a broad class of bugs that is becoming increasingly common with increasing software complexity, and many of these bugs are also security vulnerabilities. Unfortuna...
Guru Venkataramani, Brandyn Roemer, Yan Solihin, M...
104
Voted
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
16 years 1 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
PODS
2002
ACM
167views Database» more  PODS 2002»
16 years 28 days ago
OLAP Dimension Constraints
In multidimensional data models intended for online analytic processing (OLAP), data are viewed as points in a multidimensional space. Each dimension has structure, described by a...
Carlos A. Hurtado, Alberto O. Mendelzon
167
Voted
EDBT
2008
ACM
137views Database» more  EDBT 2008»
16 years 28 days ago
Data exchange in the presence of arithmetic comparisons
Data exchange is the problem of transforming data structured under a schema (called source) into data structured under a different schema (called target). The emphasis of data exc...
Foto N. Afrati, Chen Li, Vassia Pavlaki
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
15 years 7 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel