8 years 11 months ago
ABC: Algebraic Bound Computation for Loops
Abstract. We present ABC, a software tool for automatically computing symbolic upper bounds on the number of iterations of nested program loops. The system combines static analysis...
Régis Blanc, Thomas A. Henzinger, Thibaud H...
82views more  IPL 2010»
8 years 11 months ago
New upper bounds on the Boolean circuit complexity of symmetric functions
In this note, we present improved upper bounds on the circuit complexity of symmetric Boolean functions. In particular, we describe circuits of size 4.5n + o(n) for any symmetric ...
E. Demenkov, Arist Kojevnikov, Alexander S. Kuliko...
8 years 11 months ago
Worst-Case TCAM Rule Expansion
—Designers of TCAMs (ternary CAMs) for packet classification often have to deal with unpredictable sets of rules. These result in highly variable rule expansions, and can only r...
Ori Rottenstreich, Isaac Keslassy
111views Education» more  CORR 2008»
8 years 12 months ago
Concave Programming Upper Bounds on the Capacity of 2-D Constraints
The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distribut...
Ido Tal, Ron M. Roth
185views more  OSN 2007»
9 years 24 days ago
Comparison of ILP formulations for the RWA problem
— We present a review of the various integer linear programming (ILP) formulations that have been proposed for the routing and wavelength assignment problem in WDM optical networ...
Brigitte Jaumard, Christophe Meyer, B. Thiongane
78views more  TIT 2002»
9 years 29 days ago
Improved upper bounds on sizes of codes
Let ( ) denote the maximum possible number of codewords in a binary code of length and minimum Hamming distance . For large values of , the best known upper bound, for fixed , is t...
Beniamin Mounits, Tuvi Etzion, Simon Litsyn
89views more  TIT 2002»
9 years 29 days ago
Upper bounds on the rate of LDPC Codes
We derive upper bounds on the rate of low density parity check (LDPC) codes for which reliable communication is achievable. We first generalize Gallager's bound to a general ...
David Burshtein, Michael Krivelevich, Simon Litsyn...
95views more  TPDS 1998»
9 years 29 days ago
Bound Performance Models of Heterogeneous Parallel Processing Systems
- Systems of heterogeneous parallel processing are studied such as arising in parallel programs executed on distributed systems. A lower and an upper bound model are suggested to o...
Simonetta Balsamo, Lorenzo Donatiello, Nico M. van...
98views more  MOC 2002»
9 years 29 days ago
Bounds for the smallest norm in an ideal class
We develop a method for obtaining upper bounds for the smallest norm among all norms of integral ideals in an ideal class. Applying this to number fields of small degree, we are ab...
Ana-Cecilia de la Maza
113views more  CPC 2002»
9 years 1 months ago
Some Inequalities For The Largest Eigenvalue Of A Graph
Let (G) be the largest eigenvalue of the adjacency matrix of a graph G: We show that if G is Kp+1-free then (G) r 2 p 1 p e (G): This inequality was ...rst conjectured by Edwards ...
Vladimir Nikiforov