Sciweavers

971 search results - page 79 / 195
» Approximate Satisfiability and Equivalence
Sort
View
88
Voted
ORL
2008
96views more  ORL 2008»
15 years 18 days ago
A power penalty method for linear complementarity problems
In this paper we propose a power penalty approach to linear complementarity problems (LCP) in a finite dimensional space. This approach is based on approximating the LCP by a nonl...
Song Wang, Xiaoqi Yang
105
Voted
ENTCS
2008
124views more  ENTCS 2008»
15 years 6 days ago
Stability for Effective Algebras
We give a general method for showing that all numberings of certain effective algebras are recursively equivalent. The method is based on computable approximation-limit pairs. The...
Jens Blanck, Viggo Stoltenberg-Hansen, John V. Tuc...
ICASSP
2009
IEEE
15 years 7 months ago
Separable PCA for image classification
As an alternative to standard PCA, matrix-based image dimensionality reduction methods have recently been proposed and have gained attention due to reported computational efficie...
Yongxin Taylor Xi, Peter J. Ramadge
81
Voted
IJCNN
2006
IEEE
15 years 6 months ago
Learning to Rank by Maximizing AUC with Linear Programming
— Area Under the ROC Curve (AUC) is often used to evaluate ranking performance in binary classification problems. Several researchers have approached AUC optimization by approxi...
Kaan Ataman, W. Nick Street, Yi Zhang
COMPGEOM
2004
ACM
15 years 6 months ago
On the least median square problem
We consider the exact and approximate computational complexity of the multivariate LMS linear regression estimator. The LMS estimator is among the most widely used robust linear s...
Jeff Erickson, Sariel Har-Peled, David M. Mount