Sciweavers

3415 search results - page 182 / 683
» Lower Bounds for Kernelizations
Sort
View
CORR
2008
Springer
79views Education» more  CORR 2008»
15 years 4 months ago
Free Distance Bounds for Protograph-Based Regular LDPC Convolutional Codes
In this paper asymptotic methods are used to form lower bounds on the free distance to constraint length ratio of several ensembles of regular, asymptotically good, protographbased...
David G. M. Mitchell, Ali Emre Pusane, Norbert Goe...
ENDM
2008
101views more  ENDM 2008»
15 years 4 months ago
A central approach to bound the number of crossings in a generalized configuration
A generalized configuration is a set of n points and n 2 pseudolines such that each pseudoline passes through exactly two points, two pseudolines intersect exactly once, and no th...
Bernardo M. Ábrego, Silvia Fernández...
AUTOMATICA
2002
78views more  AUTOMATICA 2002»
15 years 4 months ago
Interaction bounds in multivariable control systems
Time-domain limitations due to right half-plane zeros and poles in linear multivariable control systems are studied. Lower bounds on the interaction are derived. They show not onl...
Karl Henrik Johansson
TIT
2002
146views more  TIT 2002»
15 years 4 months ago
Bounds on the performance of belief propagation decoding
We consider Gallager's soft decoding (belief propagation) algorithm for decoding low density parity check (LDPC) codes, when applied to an arbitrary binary-input symmetric-ou...
David Burshtein, Gadi Miller
FOCS
2009
IEEE
15 years 11 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu