539 search results - page 18 / 108 » Recurrence relations and fast algorithms |
101
click to vote
STOC
2009
ACM
16 years 29 days ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
110
click to vote
JCB
2002
15 years 1 days ago
2002
This paper investigates the standard ordinary least-squares version 24 and the balanced version 20 of the minimum evolution principle. For the standard version, we provide a greedy...
71
Voted
CAGD
2000
15 years 6 days ago
2000
Evaluation routines are essential for any application that uses triangular B-spline surfaces. This paper describes an algorithm to efficiently evaluate triangular B-spline surface...
CORR
2008
Springer
15 years 14 days ago
2008
Springer
In many important problems, one uses the median instead of the mean to estimate a population's center, since the former is more robust. But in general, computing the median i...
106
click to vote
SIGMOD
2005
ACM
16 years 15 days ago
2005
ACM
We consider the problem of "progressively" joining relations whose records are continuously retrieved from remote sources through an unstable network that may incur temp...