Sciweavers

1695 search results - page 111 / 339
» Linear, Polynomial or Exponential
Sort
View
ECCC
2007
96views more  ECCC 2007»
15 years 4 months ago
Linear programming bounds for codes via a covering argument
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to sh...
Michael Navon, Alex Samorodnitsky
CORR
2004
Springer
85views Education» more  CORR 2004»
15 years 4 months ago
A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree
It is well-known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of l...
Patricia M. Hill, Enea Zaffanella, Roberto Bagnara
CDC
2010
IEEE
14 years 11 months ago
On the marginal instability of linear switched systems
Stability properties for continuous-time linear switched systems are at first determined by the (largest) Lyapunov exponent associated with the system, which is the analogous of t...
Yacine Chitour, Paolo Mason, Mario Sigalotti
SIAMMAX
2011
79views more  SIAMMAX 2011»
14 years 11 months ago
Solving Rational Eigenvalue Problems via Linearization
Rational eigenvalue problems (REPs) are an emerging class of nonlinear eigenvalue problems that arise from a variety of physical applications. In this paper, we propose a lineariz...
Yangfeng Su, Zhaojun Bai
WDAG
2007
Springer
125views Algorithms» more  WDAG 2007»
15 years 10 months ago
Approximating Wardrop Equilibria with Finitely Many Agents
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
Simon Fischer, Lars Olbrich, Berthold Vöcking