21 search results - page 3 / 5 » A Discrete Farkas Lemma |
SAS
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Linear-relations analysis of transition systems discovers linear invariant relationships among the variables of the system. These relationships help establish important s...
SIAMREV
2010
13 years 15 days ago
2010
We examine condition numbers, preconditioners, and iterative methods for finite element discretizations of coercive PDEs in the context of the fundamental solvability result, the L...
COMPGEOM
2009
ACM
14 years 8 days ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
COMPGEOM
2007
ACM
13 years 9 months ago
2007
ACM
In this paper we show that dimensionality reduction (i.e., Johnson-Lindenstrauss lemma) preserves not only the distances between static points, but also between moving points, and...
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...