719 search results - page 25 / 144 » Solving Sparse Linear Constraints |
SAC
2009
ACM
15 years 5 months ago
2009
ACM
The combinatorial problem of decomposing an integer matrix into a small positive linear combination of binary matrices that have the consecutive-ones property arises in cancer rad...
85
Voted
ICRA
2007
IEEE
15 years 4 months ago
2007
IEEE
— In this paper, we define a mobile self-localization (MSL) problem for sparse mobile sensor networks, and propose an algorithm named Mobility Assisted MDS-MAP(P), based on Mult...
ESANN
2004
14 years 12 months ago
2004
This paper is based on a new way for determining the regularization trade-off in least squares support vector machines (LS-SVMs) via a mechanism of additive regularization which ha...
TCS
2008
14 years 10 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
88
Voted
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
A central problem in the analysis of motion capture (Mo-
Cap) data is how to decompose motion sequences into primitives.
Ideally, a description in terms of primitives should
fac...