Sciweavers

2767 search results - page 135 / 554
» Universal Exponentiation Algorithm
Sort
View
CORR
2008
Springer
107views Education» more  CORR 2008»
14 years 10 months ago
Power Series Composition and Change of Basis
Efficient algorithms are known for many operations on truncated power series (multiplication, powering, exponential, . . . ). Composition is a more complex task. We isolate a larg...
Alin Bostan, Bruno Salvy, Éric Schost
DAM
2006
81views more  DAM 2006»
14 years 10 months ago
Equivalence-free exhaustive generation of matroid representations
Abstract. In this paper we present an algorithm for the problem of exhaustive equivalence-free generation of 3-connected matroids which are represented by a matrix over some finite...
Petr Hlinený
IJON
2006
127views more  IJON 2006»
14 years 10 months ago
Sparse ICA via cluster-wise PCA
In this paper, it is shown that Independent Component Analysis (ICA) of sparse signals (sparse ICA) can be seen as a cluster-wise Principal Component Analysis (PCA). Consequently,...
Massoud Babaie-Zadeh, Christian Jutten, Ali Mansou...
NIPS
2003
14 years 11 months ago
Ranking on Data Manifolds
The Google search engine has enjoyed huge success with its web page ranking algorithm, which exploits global, rather than local, hyperlink structure of the web using random walks....
Dengyong Zhou, Jason Weston, Arthur Gretton, Olivi...
84
Voted
CORR
2010
Springer
163views Education» more  CORR 2010»
14 years 8 months ago
Faster Algorithms for Semi-Matching Problems
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...
Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon...