1469 search results - page 160 / 294 » Approximate polynomial decomposition |
251
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The CUR decomposition provides an approximation of a matrix X that has low reconstruction error and that is sparse in the sense that the resulting approximation lies in the span o...
168
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
This paper introduces a new method for proving global stability of fluid flows through the construction of Lyapunov functionals. For finite dimensional approximations of fluid...
167
click to vote
WWW
2005
ACM
16 years 6 months ago
2005
ACM
We exploit the recently proposed Concept Abduction inference service in Description Logics to solve Concept Covering problems. We propose a framework and polynomial greedy algorit...
135
Voted
PODS
2004
ACM
16 years 6 months ago
2004
ACM
The technique of k-anonymization has been proposed in the literature as an alternative way to release public information, while ensuring both data privacy and data integrity. We p...
162
Voted
CEC
2008
IEEE
16 years 19 days ago
2008
IEEE
— Recently it has been proved that the (1+1)-EA produces poor worst-case approximations for the vertex cover problem. In this paper the result is extended to the (1+λ)-EA by pro...