1802 search results - page 285 / 361 » Sparse Computations with PEI |
101
click to vote
ICML
2010
IEEE
15 years 29 days ago
2010
IEEE
We present a new algorithm for minimizing a convex loss-function subject to regularization. Our framework applies to numerous problems in machine learning and statistics; notably,...
114
click to vote
CAGD
2008
15 years 13 hour ago
2008
Geometric constraints have proved to be helpful for shape modeling. Moreover, they are efficient aids in controlling deformations and enhancing animation realism. The present pape...
CGF
2008
15 years 10 hour ago
2008
The visibility function in direct illumination describes the binary visibility over a light source, e.g., an environment map. Intuitively, the visibility is often strongly correla...
102
click to vote
CORR
2008
Springer
14 years 12 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...
CORR
2006
Springer
14 years 12 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...