Efficient algorithms are known for many operations on truncated power series (multiplication, powering, exponential, . . . ). Composition is a more complex task. We isolate a larg...
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...
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...
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...
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 ...