Sciweavers

1547 search results - page 120 / 310
» Solving Knapsack Problems in a Sticker Based Model
Sort
View
115
Voted
MP
2010
94views more  MP 2010»
15 years 1 months ago
MIR closures of polyhedral sets
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is N...
Sanjeeb Dash, Oktay Günlük, Andrea Lodi
TABLEAUX
2007
Springer
15 years 9 months ago
Bounded Model Checking with Description Logic Reasoning
Abstract. Model checking is a technique for verifying that a finite-state concurrent system is correct with respect to its specification. In bounded model checking (BMC), the sys...
Shoham Ben-David, Richard J. Trefler, Grant E. Wed...
PRL
2011
14 years 10 months ago
Efficient approximate Regularized Least Squares by Toeplitz matrix
Machine Learning based on the Regularized Least Square (RLS) model requires one to solve a system of linear equations. Direct-solution methods exhibit predictable complexity and s...
Sergio Decherchi, Paolo Gastaldo, Rodolfo Zunino
119
Voted
ICASSP
2011
IEEE
14 years 7 months ago
On the instantaneous frequency smoothing for signals with quasi-linear frequency changes
The problem of estimation of the slowly-varying instantaneous frequency of a nonstationary complex sinusoidal signal buried in noise is considered. This problem is usually solved ...
Maciej Niedzwiecki, Michal Stanislaw Meller
118
Voted
IJCV
2006
116views more  IJCV 2006»
15 years 3 months ago
Structure-Texture Image Decomposition - Modeling, Algorithms, and Parameter Selection
This paper explores various aspects of the image decomposition problem using modern variational techniques. We aim at splitting an original image f into two components u and v, whe...
Jean-François Aujol, Guy Gilboa, Tony F. Ch...