1368 search results - page 162 / 274 » Generalized Rook Polynomials |
139
click to vote
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
165
Voted
MOBICOM
2003
ACM
15 years 10 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
149
Voted
PODC
2010
ACM
15 years 8 months ago
2010
ACM
A token is hidden in one of several boxes and then the boxes are locked. The probability of placing the token in each of the boxes is known. A searcher is looking for the token by...
140
click to vote
SIGECOM
2010
ACM
15 years 5 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
149
click to vote
CORR
2007
Springer
15 years 5 months ago
2007
Springer
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...