318 search results - page 62 / 64 » On the equivalence of linear complementarity problems |
KDD
2008
ACM
14 years 7 months ago
2008
ACM
Kernel methods have been applied successfully in many data mining tasks. Subspace kernel learning was recently proposed to discover an effective low-dimensional subspace of a kern...
ATAL
2009
Springer
2009
Springer
Effective solutions for real-world Stackelberg games: when agents must deal with human uncertainties
14 years 2 months ago
How do we build multiagent algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human intera...
PG
2007
IEEE
14 years 1 months ago
2007
IEEE
We describe a new algorithm for the visualisation of implicit algebraic curves, which isolates the singular points, compute the topological degree around these points in order to ...
WMPI
2004
ACM
14 years 27 days ago
2004
ACM
The Opie Project aims to develop a compiler to transform C codes written for row-major matrix representation into equivalent codes for Morton-order matrix representation, and to a...
ICALP
2004
Springer
14 years 26 days ago
2004
Springer
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take ...