Sciweavers

1510 search results - page 87 / 302
» Upper Probabilities and Additivity
Sort
View
ESA
2006
Springer
106views Algorithms» more  ESA 2006»
15 years 4 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
85
Voted
CORR
2010
Springer
103views Education» more  CORR 2010»
14 years 10 months ago
Least Squares Superposition Codes of Moderate Dictionary Size, Reliable at Rates up to Capacity
Sparse superposition codes are developed for the additive white Gaussian noise channel with average codeword power constraint. Codewords are linear combinations of subsets of vecto...
Andrew R. Barron, Antony Joseph
LCTRTS
2010
Springer
15 years 2 months ago
Resilience analysis: tightening the CRPD bound for set-associative caches
In preemptive real-time systems, scheduling analyses need—in addition to the worst-case execution time—the context-switch cost. In case of preemption, the preempted and the pr...
Sebastian Altmeyer, Claire Maiza, Jan Reineke
113
Voted
ACL
2006
15 years 2 months ago
A Progressive Feature Selection Algorithm for Ultra Large Feature Spaces
Recent developments in statistical modeling of various linguistic phenomena have shown that additional features give consistent performance improvements. Quite often, improvements...
Qi Zhang, Fuliang Weng, Zhe Feng
ICCAD
1997
IEEE
118views Hardware» more  ICCAD 1997»
15 years 5 months ago
Global interconnect sizing and spacing with consideration of coupling capacitance
This paper presents an efficient approach to perform global interconnect sizing and spacing (GISS) for multiple nets to minimize interconnect delays with consideration of couplin...
Jason Cong, Lei He, Cheng-Kok Koh, David Zhigang P...