1552 search results - page 33 / 311 » On the Complexity of Constant Propagation |
129
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
138
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Support vector machines (SVMs) are an extremely successful type of classification and regression algorithms. Building an SVM entails solving a constrained convex quadratic program...
136
click to vote
LATIN
2010
Springer
15 years 8 months ago
2010
Springer
We consider the multiplication of a sparse N × N matrix A with a dense N × N matrix B in the I/O model. We determine the worst-case non-uniform complexity of this task up to a c...
130
click to vote
CVPR
2005
IEEE
16 years 3 months ago
2005
IEEE
We propose an approximate Bayesian approach for unsupervised feature selection and density estimation, where the importance of the features for clustering is used as the measure f...
130
Voted
KR
2000
Springer
15 years 5 months ago
2000
Springer
In contrast with classical reasoning, where a solution is either correct or incorrect, approximate reasoning tries to compute solutions which are close to the ideal solution, with...