Sciweavers

2944 search results - page 65 / 589
» Improving Bound Propagation
Sort
View
CRYPTO
2005
Springer
94views Cryptology» more  CRYPTO 2005»
14 years 3 months ago
Improved Security Analyses for CBC MACs
We present an improved bound on the advantage of any q-query adversary at distinguishing between the CBC MAC over a random n-bit permutation and a random function outputting n bit...
Mihir Bellare, Krzysztof Pietrzak, Phillip Rogaway
COMPGEOM
2010
ACM
14 years 3 months ago
Improving the first selection lemma in R3
We present new bounds on the first selection lemma in R3 . This makes progress on the open problems of Bukh, Matoušek and Nivash [6] and Boros-Füredi [4] for the three-dimensio...
Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfra...
SODA
2001
ACM
93views Algorithms» more  SODA 2001»
13 years 11 months ago
Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3list-coloring. Our algorithms are based on a constraint satisfaction...
David Eppstein
ICC
2009
IEEE
161views Communications» more  ICC 2009»
14 years 4 months ago
Linear MMSE MIMO Channel Estimation with Imperfect Channel Covariance Information
—In this paper, we investigate the effects of imperfect knowledge of the channel covariance matrix on the performance of a linear minimum mean-square-error (MMSE) estimator for m...
Antonio Assalini, Emiliano Dall'Anese, Silvano Pup...
ASPDAC
2005
ACM
101views Hardware» more  ASPDAC 2005»
14 years 3 months ago
Lower bounds for dynamic BDD reordering
— In this paper we present new lower bounds on BDD size. These lower bounds are derived from more general lower bounds that recently were given in the context of exact BDD minimi...
Rüdiger Ebendt, Rolf Drechsler