Sciweavers

258 search results - page 22 / 52
» New Lower Bounds for Heilbronn Numbers
Sort
View
LCTRTS
2010
Springer
13 years 9 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
ECCC
2010
89views more  ECCC 2010»
13 years 7 months ago
Estimating the unseen: A sublinear-sample canonical estimator of distributions
We introduce a new approach to characterizing the unobserved portion of a distribution, which provides sublinear-sample additive estimators for a class of properties that includes...
Gregory Valiant, Paul Valiant
GBRPR
2003
Springer
14 years 23 days ago
Constructing Stochastic Pyramids by MIDES - Maximal Independent Directed Edge Set
Abstract. We present a new method (MIDES) to determine contraction kernels for the construction of graph pyramids. Experimentally the new method has a reduction factor higher than ...
Yll Haxhimusa, Roland Glantz, Walter G. Kropatsch
COMPGEOM
2010
ACM
14 years 19 days ago
Incidences in three dimensions and distinct distances in the plane
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
György Elekes, Micha Sharir
CRYPTO
2008
Springer
75views Cryptology» more  CRYPTO 2008»
13 years 9 months ago
New Efficient Attacks on Statistical Disclosure Control Mechanisms
The goal of a statistical database is to provide statistics about a population while simultaneously protecting the privacy of the individual records in the database. The tension be...
Cynthia Dwork, Sergey Yekhanin