Sciweavers

719 search results - page 18 / 144
» Solving Sparse Linear Constraints
Sort
View
CORR
2010
Springer
103views Education» more  CORR 2010»
14 years 7 months ago
Least Squares Superposition Codes of Moderate Dictionary Size, Reliable at Rates up to Capacity
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...
Andrew R. Barron, Antony Joseph
SIAMJO
2010
128views more  SIAMJO 2010»
14 years 5 months ago
Solving Log-Determinant Optimization Problems by a Newton-CG Primal Proximal Point Algorithm
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...
Chengjing Wang, Defeng Sun, Kim-Chuan Toh
APLAS
2011
ACM
13 years 10 months ago
Solving Recursion-Free Horn Clauses over LI+UIF
Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively auusing abstraction and refinement schemes that rely o...
Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenk...
IJCNN
2006
IEEE
15 years 4 months ago
Sparse Optimization for Second Order Kernel Methods
— 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...
Roland Vollgraf, Klaus Obermayer
ISSAC
1997
Springer
142views Mathematics» more  ISSAC 1997»
15 years 2 months ago
The Structure of Sparse Resultant Matrices
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...
Ioannis Z. Emiris, Victor Y. Pan