Sciweavers

318 search results - page 17 / 64
» On the equivalence of linear complementarity problems
Sort
View
SIGGRAPH
2010
ACM
13 years 11 months ago
Volume contact constraints at arbitrary resolution
We introduce a new method for simulating frictional contact between volumetric objects using interpenetration volume constraints. When applied to complex geometries, our formulati...
Jérémie Allard, François Faure, Hadrien Courtec...
IJCNN
2006
IEEE
14 years 1 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
CORR
2010
Springer
96views Education» more  CORR 2010»
13 years 7 months ago
LSMR: An iterative algorithm for sparse least-squares problems
Abstract. An iterative method LSMR is presented for solving linear systems Ax = b and leastsquares problem min Ax - b 2, with A being sparse or a fast linear operator. LSMR is base...
David Fong, Michael Saunders
SAS
2004
Springer
14 years 26 days ago
A Polynomial-Time Algorithm for Global Value Numbering
We describe a polynomial-time algorithm for global value numbering, which is the problem of discovering equivalences among program sub-expressions. We treat all conditionals as non...
Sumit Gulwani, George C. Necula
TSP
2008
148views more  TSP 2008»
13 years 7 months ago
Statistically Robust Design of Linear MIMO Transceivers
The treatment of channel state information (CSI) is critical in the design of MIMO systems. Accurate CSI at the transmitter is often not possible or may require high feedback rate...
Xi Zhang, Daniel Pérez Palomar, Björn ...