497 search results - page 18 / 100 » Approximating max-min linear programs with local algorithms |
ICALP
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
106
click to vote
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
Abstract-We study the well known linear consensus algorithm by means of a LQ-type performance cost. We want to understand how the communication topology influences this algorithm. ...
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...
101
click to vote
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Linear discriminant analysis (LDA) is a widely used feature extraction method for classification. We introduce distributed implementations of different versions of LDA, suitable ...