Sciweavers

1081 search results - page 16 / 217
» Working with the LR Degrees
Sort
View
ECCC
2006
134views more  ECCC 2006»
13 years 9 months ago
Derandomizing the AW matrix-valued Chernoff bound using pessimistic estimators and applications
Ahlswede and Winter [AW02] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound for real-valued random...
Avi Wigderson, David Xiao
SIAMDM
2010
96views more  SIAMDM 2010»
13 years 8 months ago
Note on Bipartite Graph Tilings
Let s < t be two fixed positive integers. We study what are the minimum degree conditions for a bipartite graph G, with both color classes of size n = k(s + t), which ensure t...
Jan Hladký, Mathias Schacht
IJCV
2012
12 years 5 days ago
Impact of Landmark Parametrization on Monocular EKF-SLAM with Points and Lines
Abstract This paper explores the impact that landmark parametrization has in the performance of monocular, EKFbased, 6-DOF simultaneous localization and mapping (SLAM) in the conte...
Joan Solà, Teresa A. Vidal-Calleja, Javier ...
FSE
2006
Springer
109views Cryptology» more  FSE 2006»
14 years 1 months ago
Computing the Algebraic Immunity Efficiently
The purpose of algebraic attacks on stream and block ciphers is to recover the secret key by solving an overdefined system of multivariate algebraic equations. They become very eff...
Frédéric Didier, Jean-Pierre Tillich
SODA
2012
ACM
195views Algorithms» more  SODA 2012»
12 years 5 days ago
Concentration and moment inequalities for polynomials of independent random variables
In this work we design a general method for proving moment inequalities for polynomials of independent random variables. Our method works for a wide range of random variables incl...
Warren Schudy, Maxim Sviridenko