Sciweavers

54 search results - page 5 / 11
» Computing symmetric rank for symmetric tensors
Sort
View
JCAM
2011
78views more  JCAM 2011»
14 years 1 months ago
Symmetric box-splines on root lattices
Root lattices are efficient sampling lattices for reconstructing isotropic signals in arbitrary dimensions, due to their highly symmetric structure. One root lattice, the Cartesia...
Minho Kim, Jörg Peters
JACM
2011
98views more  JACM 2011»
14 years 6 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
IJCV
2006
165views more  IJCV 2006»
14 years 11 months ago
A Riemannian Framework for Tensor Computing
Tensors are nowadays a common source of geometric information. In this paper, we propose to endow the tensor space with an affine-invariant Riemannian metric. We demonstrate that ...
Xavier Pennec, Pierre Fillard, Nicholas Ayache
TMI
2008
92views more  TMI 2008»
14 years 11 months ago
Using Perturbation Theory to Compute the Morphological Similarity of Diffusion Tensors
Computing the morphological similarity of diffusion tensors (DTs) at neighboring voxels within a DT image, or at corresponding locations across different DT images, is a fundamenta...
Ravi Bansal, Lawrence H. Staib, Dongrong Xu, Andre...
IPPS
2005
IEEE
15 years 4 months ago
An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs)
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
Guojing Cong, David A. Bader