719 search results - page 18 / 144 » Solving Sparse Linear Constraints |
83
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Sparse superposition codes are developed for the additive white Gaussian noise channel with average codeword power constraint. Codewords are linear combinations of subsets of vecto...
90
Voted
SIAMJO
2010
14 years 7 months ago
2010
We propose a Newton-CG primal proximal point algorithm for solving large scale log-determinant optimization problems. Our algorithm employs the essential ideas of the proximal poi...
112
Voted
APLAS
2011
ACM
14 years 13 days ago
2011
ACM
Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively auusing abstraction and refinement schemes that rely o...
135
Voted
IJCNN
2006
IEEE
15 years 6 months ago
2006
IEEE
— We present a new optimization procedure which is particularly suited for the solution of second-order kernel methods like e.g. Kernel-PCA. Common to these methods is that there...
107
Voted
ISSAC
1997
Springer
15 years 4 months ago
1997
Springer
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...