Sciweavers

511 search results - page 41 / 103
» The intrinsic dimensionality of graphs
Sort
View
COMPLEXITY
2010
124views more  COMPLEXITY 2010»
13 years 7 months ago
Spatially embedded dynamics and complexity
To gain a deeper understanding of the impact of spatial embedding on the dynamics of complex systems we employ a measure of interaction complexity developed within neuroscience us...
Christopher L. Buckley, Seth Bullock, Lionel Barne...
CORR
2012
Springer
225views Education» more  CORR 2012»
12 years 5 months ago
Compressive Principal Component Pursuit
We consider the problem of recovering a target matrix that is a superposition of low-rank and sparse components, from a small set of linear measurements. This problem arises in co...
John Wright, Arvind Ganesh, Kerui Min, Yi Ma
ICML
2006
IEEE
14 years 10 months ago
Discriminative cluster analysis
Clustering is one of the most widely used statistical tools for data analysis. Among all existing clustering techniques, k-means is a very popular method because of its ease of pr...
Fernando De la Torre, Takeo Kanade
RSA
2010
91views more  RSA 2010»
13 years 8 months ago
The second largest component in the supercritical 2D Hamming graph
The 2-dimensional Hamming graph H(2, n) consists of the n2 vertices (i, j), 1 ≤ i, j ≤ n, two vertices being adjacent when they share a common coordinate. We examine random sub...
Remco van der Hofstad, Malwina J. Luczak, Joel Spe...
SI3D
2012
ACM
12 years 5 months ago
4D parametric motion graphs for interactive animation
A 4D parametric motion graph representation is presented for interactive animation from actor performance capture in a multiple camera studio. The representation is based on a 4D ...
Dan Casas, Margara Tejera, Jean-Yves Guillemaut, A...