Sciweavers

676 search results - page 6 / 136
» Sub-stochastic matrix analysis for bounds computation - Theo...
Sort
View
FM
2009
Springer
123views Formal Methods» more  FM 2009»
14 years 1 months ago
"Carbon Credits" for Resource-Bounded Computations Using Amortised Analysis
Abstract. Bounding resource usage is important for a number of areas, notably real-time embedded systems and safety-critical systems. In this paper, we present a fully automatic st...
Steffen Jost, Hans-Wolfgang Loidl, Kevin Hammond, ...
ICML
2005
IEEE
14 years 8 months ago
Statistical and computational analysis of locality preserving projection
Recently, several manifold learning algorithms have been proposed, such as ISOMAP (Tenenbaum et al., 2000), Locally Linear Embedding (Roweis & Saul, 2000), Laplacian Eigenmap ...
Xiaofei He, Deng Cai, Wanli Min
JACM
2011
98views more  JACM 2011»
13 years 2 months ago
Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix
We analyze the convergence of randomized trace estimators. Starting at 1989, several algorithms have been proposed for estimating the trace of a matrix by 1 M M i=1 zT i Azi, where...
Haim Avron, Sivan Toledo
CVPR
2000
IEEE
14 years 9 months ago
A Robust and Efficient Motion Segmentation Based on Orthogonal Projection Matrix of Shape Space
A novel algorithm for motion segmentation is proposed. The algorithm uses the fact that shape of an object with homogeneous motion is represented as 4 dimensional linear space. Th...
Naoyuki Ichimura
ICA
2007
Springer
13 years 11 months ago
Estimating the Mixing Matrix in Sparse Component Analysis Based on Converting a Multiple Dominant to a Single Dominant Problem
We propose a new method for estimating the mixing matrix, A, in the linear model x(t) = As(t), t = 1, . . . , T, for the problem of underdetermined Sparse Component Analysis (SCA)....
Nima Noorshams, Massoud Babaie-Zadeh, Christian Ju...