Sciweavers

3415 search results - page 268 / 683
» Lower bounds on kernelization
Sort
View
CIE
2009
Springer
16 years 1 months ago
Cutting Planes and the Parameter Cutwidth
We introduce the parameter cutwidth for the Cutting Planes (CP) system of Gomory and Chv´atal. We provide linear lower bounds on cutwidth for two simple polytopes. Considering CP ...
Stefan S. Dantchev, Barnaby Martin
GD
1997
Springer
15 years 11 months ago
Orthogonal 3-D Graph Drawing
This paper studies 3-D orthogonal grid drawings for graphs of arbitrary degree, in particular Kn, with vertices drawn as boxes. It establishes asymptotic lower bounds for the volu...
Therese C. Biedl, Thomas C. Shermer, Sue Whiteside...
PAMI
2006
145views more  PAMI 2006»
15 years 6 months ago
Convergent Tree-Reweighted Message Passing for Energy Minimization
Algorithms for discrete energy minimization are of fundamental importance in computer vision. In this paper we focus on the recent technique proposed by Wainwright et al. [33] - t...
Vladimir Kolmogorov
TIT
1998
79views more  TIT 1998»
15 years 6 months ago
Capacity of Two-Layer Feedforward Neural Networks with Binary Weights
— The lower and upper bounds for the information capacity of two-layer feedforward neural networks with binary interconnections, integer thresholds for the hidden units, and zero...
Chuanyi Ji, Demetri Psaltis
ECCC
2010
87views more  ECCC 2010»
15 years 5 months ago
On the degree of symmetric functions on the Boolean cube
In this paper we study the degree of non-constant symmetric functions f : {0, 1}n → {0, 1, . . . , c}, where c ∈ N, when represented as polynomials over the real numbers. We s...
Gil Cohen, Amir Shpilka