Sciweavers

2652 search results - page 463 / 531
» Privacy-preserving linear programming
Sort
View
CORR
2011
Springer
143views Education» more  CORR 2011»
14 years 1 months ago
Probabilistic Logic: Many-valuedness and Intensionality
The probability theory is a well-studied branch of mathematics, in order to carry out formal reasoning about probability. Thus, it is important to have a logic, both for computati...
Zoran Majkic
CORR
2011
Springer
174views Education» more  CORR 2011»
14 years 1 months ago
Lift-and-Project Integrality Gaps for the Traveling Salesperson Problem
We study the lift-and-project procedures of Lov´asz-Schrijver and Sherali-Adams applied to the standard linear programming relaxation of the traveling salesperson problem with tr...
Thomas Watson
GLVLSI
2011
IEEE
351views VLSI» more  GLVLSI 2011»
14 years 1 months ago
Design of low-power multiple constant multiplications using low-complexity minimum depth operations
Existing optimization algorithms for the multiplierless realization of multiple constant multiplications (MCM) typically target the minimization of the number of addition and subt...
Levent Aksoy, Eduardo Costa, Paulo F. Flores, Jos&...
ICASSP
2011
IEEE
14 years 1 months ago
Recovery of sparse perturbations in Least Squares problems
We show that the exact recovery of sparse perturbations on the coefficient matrix in overdetermined Least Squares problems is possible for a large class of perturbation structure...
Mert Pilanci, Orhan Arikan
ICASSP
2011
IEEE
14 years 1 months ago
Multiple kernel nonnegative matrix factorization
Kernel nonnegative matrix factorization (KNMF) is a recent kernel extension of NMF, where matrix factorization is carried out in a reproducing kernel Hilbert space (RKHS) with a f...
Shounan An, Jeong-Min Yun, Seungjin Choi