1813 search results - page 60 / 363 » Calculi of Approximation Spaces |
168
click to vote
MCS
2008
Springer
15 years 5 months ago
2008
Springer
Dynamical low-rank approximation is a differential-equation based approach to efficiently computing low-rank approximations to time-dependent large data matrices or to solutions o...
175
click to vote
SIAMMAX
2010
15 years 28 days ago
2010
For the approximation of time-dependent data tensors and of solutions to tensor differential equations by tensors of low Tucker rank, we study a computational approach that can be ...
251
click to vote
ICDE
2003
IEEE
16 years 7 months ago
2003
IEEE
Iceberg-cube mining is to compute the GROUP BY partitions, for all GROUP BY dimension lists, that satisfy a given aggregate constraint. Previous works have pushed anti-monotone co...
135
click to vote
GECCO
2007
Springer
16 years 10 days ago
2007
Springer
The role of space is more and more accepted as a way to dramatically improve the success of coevolutionary function approximation. The process behind this success however is not y...
175
click to vote
CP
2004
Springer
15 years 11 months ago
2004
Springer
We study the quality of LP-based approximation methods for pure combinatorial problems. We found that the quality of the LPrelaxation is a direct function of the underlying constra...