Sciweavers

318 search results - page 35 / 64
» On the equivalence of linear complementarity problems
Sort
View
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
13 years 7 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky
ICCAD
1999
IEEE
66views Hardware» more  ICCAD 1999»
13 years 12 months ago
Test scheduling for core-based systems
We present optimal solutions to the test scheduling problem for core-based systems. We show that test scheduling is equivalent to the m-processor open-shop scheduling problem and ...
Krishnendu Chakrabarty
CORR
2008
Springer
113views Education» more  CORR 2008»
13 years 7 months ago
Distributed Kalman Filter via Gaussian Belief Propagation
Abstract--Recent result shows how to compute distributively and efficiently the linear MMSE for the multiuser detection problem, using the Gaussian BP algorithm. In the current wor...
Danny Bickson, Ori Shental, Danny Dolev
ANOR
2010
96views more  ANOR 2010»
13 years 7 months ago
Lipschitz and differentiability properties of quasi-concave and singular normal distribution functions
Abstract The paper provides a condition for differentiability as well as an equivalent criterion for Lipschitz continuity of singular normal distributions. Such distributions are o...
René Henrion, Werner Römisch
ICML
2010
IEEE
13 years 8 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein