1068 search results - page 23 / 214 » Factorization as a Rank 1 Problem |
230
click to vote
APPROX
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
171
click to vote
ITICSE
2010
ACM
15 years 11 months ago
2010
ACM
Previous reports of a media computation approach to teaching programming have either focused on pre-CS1 courses or courses for non-majors. We report the adoption of a media comput...
249
click to vote
PODS
2012
ACM
13 years 10 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
207
click to vote
ALGORITHMICA
2007
15 years 7 months ago
2007
A 0-1 matrix has the Consecutive Ones Property (C1P) if there is a permutation of its columns that leaves the 1’s consecutive in each row. The Consecutive Ones Submatrix (C1S) p...
159
click to vote
COLING
2010
15 years 2 months ago
2010
This paper presents a comparative study on two key problems existing in extractive summarization: the ranking problem and the selection problem. To this end, we presented a system...