1469 search results - page 137 / 294 » Approximate polynomial decomposition |
101
click to vote
QOSIP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We explore techniques for efficient Quality of Service Routing in the presence of multiple constraints. We first present a polynomial time approximation algorithm for th...
102
click to vote
ECCC
2006
14 years 10 months ago
2006
Suppose you ran a chess tournament, everybody played everybody, and you wanted to use the results to rank everybody. Unless you were really lucky, the results would not be acyclic...
121
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
Abstract—We consider a certain class of large random matrices, composed of independent column vectors with zero mean and different covariance matrices, and derive asymptotically ...
104
click to vote
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
The problem of computing low rank approximations of matrices is considered. The novel aspect of our approach is that the low rank approximations are on a collection of matrices. W...
STACS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...