Sciweavers

3415 search results - page 206 / 683
» Lower bounds on kernelization
Sort
View
IPCO
2010
153views Optimization» more  IPCO 2010»
15 years 4 months ago
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
Christoph Buchheim, Alberto Caprara, Andrea Lodi
DCC
2010
IEEE
15 years 1 months ago
Parameter choices and a better bound on the list size in the Guruswami-Sudan algorithm for algebraic geometry codes
Abstract. Given an algebraic geometry code CL(D, P), the GuruswamiSudan algorithm produces a list of all codewords in CL(D, P) within a specified distance of a received word. The i...
Nathan Drake, Gretchen L. Matthews
MSS
2011
IEEE
159views Hardware» more  MSS 2011»
14 years 10 months ago
Reversals of signal-posterior monotonicity for any bounded prior
Paul Milgrom (The Bell Journal of Economics, 12(2): 380–391) showed that if the strict monotone likelihood ratio property (MLRP) does not hold for a conditional distribution the...
Christopher P. Chambers, Paul J. Healy
ASIACRYPT
2009
Springer
16 years 25 days ago
Security Bounds for the Design of Code-Based Cryptosystems
Code-based cryptography is often viewed as an interesting “Post-Quantum” alternative to the classical number theory cryptography. Unlike many other such alternatives, it has th...
Matthieu Finiasz, Nicolas Sendrier
CISS
2008
IEEE
16 years 21 days ago
Cramer Rao bound on target localization estimation in MIMO radar systems
Abstract— This paper presents an analysis of target localization accuracy, attainable by the use of MIMO (MultipleInput Multiple-Output) radar systems, configured with multiple ...
Hana Godrich, Alexander M. Haimovich, Rick S. Blum