1469 search results - page 3 / 294 » Approximate polynomial decomposition |
MKM
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Recent work has detailed the conditions under which univariate Laurent polynomials have functional decompositions. This paper presents algorithms to compute such univaria...
ICASSP
2009
IEEE
14 years 3 months ago
2009
IEEE
Iterative shrinkage of sparse and redundant representations are at the heart of many state of the art denoising and deconvolution algorithms. They assume the signal is well approx...
SIGIR
2004
ACM
14 years 1 months ago
2004
ACM
Latent Semantic Indexing (LSI) is a well established and effective framework for conceptual information retrieval. In traditional implementations of LSI the semantic structure of...
AAAI
1990
13 years 9 months ago
1990
This paper concerns the task of removing redundant information from a given knowledge base, and restructuring it in the form of a tree, so as to admit efficient problem solving ro...
WAOA
2005
Springer
14 years 2 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...