563 search results - page 35 / 113 » Computing approximate PSD factorizations |
ICCS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In this paper we study the problem of determining threedimensional orientations for noisy projections of randomly oriented identical particles. The problem is of central ...
DAGSTUHL
2007
15 years 1 months ago
2007
We present a stationary iterative scheme for PageRank computation. The algorithm is based on a linear system formulation of the problem, uses inner/outer iterations, and amounts to...
IJCV
2006
15 years 7 days ago
2006
: Linear subspace analysis (LSA) has become rather ubiquitous in a wide range of problems arising in pattern recognition and computer vision. The essence of these approaches is tha...
HYBRID
2004
Springer
15 years 5 months ago
2004
Springer
The joint spectral radius of a set of matrices is a measure of the maximal asymptotic growth rate that can be obtained by forming long products of matrices taken from the set. This...
98
Voted
FOCS
2004
IEEE
15 years 4 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...