Sciweavers

39 search results - page 5 / 8
» Monotone complexity and the rank of matrices
Sort
View
MP
2010
150views more  MP 2010»
13 years 1 months ago
The algebraic degree of semidefinite programming
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minima...
Jiawang Nie, Kristian Ranestad, Bernd Sturmfels
SIGECOM
2003
ACM
135views ECommerce» more  SIGECOM 2003»
13 years 12 months ago
Playing large games using simple strategies
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
Richard J. Lipton, Evangelos Markakis, Aranyak Meh...
CVPR
2005
IEEE
14 years 8 months ago
On the Absolute Quadratic Complex and Its Application to Autocalibration
This article introduces the absolute quadratic complex formed by all lines that intersect the absolute conic. If denotes the 3 ? 3 symmetric matrix representing the image of that ...
Jean Ponce, Kenton McHenry, Théodore Papado...
PC
2002
158views Management» more  PC 2002»
13 years 6 months ago
On parallel block algorithms for exact triangularizations
We present a new parallel algorithm to compute an exact triangularization of large square or rectangular and dense or sparse matrices in any field. Using fast matrix multiplicatio...
Jean-Guillaume Dumas, Jean-Louis Roch
CVPR
2011
IEEE
13 years 2 months ago
Accelerated Low-Rank Visual Recovery by Random Projection
Exact recovery from contaminated visual data plays an important role in various tasks. By assuming the observed data matrix as the addition of a low-rank matrix and a sparse matri...
Yadong Mu, Jian Dong, Xiaotong Yuan, Shuicheng Yan