Sciweavers

584 search results - page 23 / 117
» Efficient mass decomposition
Sort
View
ICML
2009
IEEE
14 years 9 months ago
On sampling-based approximate spectral decomposition
This paper addresses the problem of approximate singular value decomposition of large dense matrices that arises naturally in many machine learning applications. We discuss two re...
Sanjiv Kumar, Mehryar Mohri, Ameet Talwalkar
JSC
2008
162views more  JSC 2008»
13 years 8 months ago
Approximate factorization of multivariate polynomials using singular value decomposition
We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficie...
Erich Kaltofen, John P. May, Zhengfeng Yang, Lihon...
EMNLP
2010
13 years 6 months ago
Dual Decomposition for Parsing with Non-Projective Head Automata
This paper introduces algorithms for nonprojective parsing based on dual decomposition. We focus on parsing algorithms for nonprojective head automata, a generalization of head-au...
Terry Koo, Alexander M. Rush, Michael Collins, Tom...
ICIP
2005
IEEE
14 years 10 months ago
Interleaved S+P pyramidal decomposition with refined prediction model
Scalability and others functionalities such as the Region of Interest encoding become essential properties of an efficient image coding scheme. Within the framework of lossless co...
Joseph Ronsin, Marie Babel, Olivier Déforge...
ISSAC
2009
Springer
167views Mathematics» more  ISSAC 2009»
14 years 3 months ago
High order derivatives and decomposition of multivariate polynomials
In this paper, we present an improved method for decomposing multivariate polynomials. This problem, also known as the Functional Decomposition Problem (FDP) [17, 9, 27], is class...
Jean-Charles Faugère, Ludovic Perret