25 search results - page 5 / 5 » On the representation and multiplication of hypersparse matr... |
JMLR
2010
13 years 3 days ago
2010
Hsu et al. (2009) recently proposed an efficient, accurate spectral learning algorithm for Hidden Markov Models (HMMs). In this paper we relax their assumptions and prove a tighte...
CPM
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
CCA
2000
Springer
13 years 9 months ago
2000
Springer
Computing the spectral decomposition of a normal matrix is among the most frequent tasks to numerical mathematics. A vast range of methods are employed to do so, but all of them su...
ECCV
2004
Springer
14 years 7 months ago
2004
Springer
This paper addresses the problem of estimating the 3D shape of a smooth textureless solid from multiple images acquired under orthographic projection from unknown and unconstrained...
ICANNGA
2007
Springer
13 years 11 months ago
2007
Springer
In this paper we present a new method of 3D non-negative tensor factorization (NTF) that is robust in the presence of noise and has many potential applications, including multi-way...