Sciweavers

3068 search results - page 274 / 614
» Clustering with Multiple Graphs
Sort
View
CVPR
2011
IEEE
15 years 2 months ago
A Closed Form Solution to Robust Subspace Estimation and Clustering
We consider the problem of fitting one or more subspaces to a collection of data points drawn from the subspaces and corrupted by noise/outliers. We pose this problem as a rank m...
Paolo Favaro, René, Vidal, Avinash Ravichandran
EDBT
2006
ACM
116views Database» more  EDBT 2006»
16 years 6 months ago
VICO: Visualizing Connected Object Orderings
In modern databases, complex objects like multimedia data, proteins or text objects can be modeled in a variety of representations and can be decomposed into multiple instances of ...
Stefan Brecheisen, Hans-Peter Kriegel, Matthias Sc...
GLOBECOM
2009
IEEE
16 years 1 months ago
Opportunistic Cell Edge Selection in Multi-Cell OFDMA Networks
Abstract— We propose an intercell downlink orthogonal frequency division multiple access (OFDMA) scheduling technique in a sectorized cellular network. Adjacent sectors from neig...
Chun Kin Au-Yeung, Amine Maaref, Jinyun Zhang
TMI
2010
182views more  TMI 2010»
15 years 5 months ago
A Bayesian Mixture Approach to Modeling Spatial Activation Patterns in Multisite fMRI Data
Abstract—We propose a probabilistic model for analyzing spatial activation patterns in multiple functional magnetic resonance imaging (fMRI) activation images such as repeated ob...
Seyoung Kim, Padhraic Smyth, Hal S. Stern
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
16 years 7 months ago
Quadratic forms on graphs
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
Noga Alon, Konstantin Makarychev, Yury Makarychev,...