Sciweavers

474 search results - page 8 / 95
» Approximation Algorithms for Tensor Clustering
Sort
View
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
14 years 8 months ago
Tensor-CUR decompositions for tensor-based data
Motivated by numerous applications in which the data may be modeled by a variable subscripted by three or more indices, we develop a tensor-based extension of the matrix CUR decom...
Michael W. Mahoney, Mauro Maggioni, Petros Drineas
ISAAC
2005
Springer
122views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Fast k-Means Algorithms with Constant Approximation
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
Mingjun Song, Sanguthevar Rajasekaran
ISBRA
2007
Springer
14 years 2 months ago
Coclustering Based Parcellation of Human Brain Cortex Using Diffusion Tensor MRI
The fundamental goal of computational neuroscience is to discover anatomical features that reflect the functional organization of the brain. Investigations of the physical connect...
Cui Lin, Shiyong Lu, Danqing Wu, Jing Hua, Otto Mu...
ECCV
1998
Springer
14 years 9 months ago
Concerning Bayesian Motion Segmentation, Model, Averaging, Matching and the Trifocal Tensor
Abstract. Motion segmentation involves identifying regions of the image that correspond to independently moving objects. The number of independently moving objects, and type of mot...
Philip H. S. Torr, Andrew Zisserman
MP
2010
172views more  MP 2010»
13 years 6 months ago
Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
In this paper, we consider approximation algorithms for optimizing a generic multi-variate homogeneous polynomial function, subject to homogeneous quadratic constraints. Such opti...
Simai He, Zhening Li, Shuzhong Zhang