198 search results - page 40 / 40 » Tensor Rank: Some Lower and Upper Bounds |
SIAMSC
2008
14 years 10 months ago
2008
In this Part II of this paper we first refine the analysis of error-free vector transformations presented in Part I. Based on that we present an algorithm for calculating the round...
ISTCS
1997
Springer
15 years 2 months ago
1997
Springer
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
110
click to vote
ASIAN
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...