2976 search results - page 440 / 596 » On the bounded integer programming |
96
Voted
ICIP
2009
IEEE
16 years 3 months ago
2009
IEEE
In this paper, following the Compressed Sensing (CS) paradigm, we study the problem of recovering sparse or compressible signals from uniformly quantized measurements. We present ...
115
click to vote
DAC
1999
ACM
16 years 3 months ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
113
click to vote
FSTTCS
2009
Springer
15 years 9 months ago
2009
Springer
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...
130
click to vote
SARA
2009
Springer
15 years 8 months ago
2009
Springer
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
111
click to vote
TPHOL
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract We present the generic system framework of Isabelle/Isar underlying recent versions of Isabelle. Among other things, Isar provides an infrastructure for Isabelle plug-ins,...