Sciweavers

511 search results - page 25 / 103
» The intrinsic dimensionality of graphs
Sort
View
SODA
2012
ACM
268views Algorithms» more  SODA 2012»
13 years 2 months ago
Analyzing graph structure via linear measurements
We initiate the study of graph sketching, i.e., algorithms that use a limited number of linear measurements of a graph to determine the properties of the graph. While a graph on n...
Kook Jin Ahn, Sudipto Guha, Andrew McGregor
ICPR
2010
IEEE
15 years 2 months ago
Entropy Estimation and Multi-Dimensional Scale Saliency
In this paper we survey two multi-dimensional Scale Saliency approaches based on graphs and the k-d partition algorithm. In the latter case we introduce a new divergence metric an...
Pablo Suau, Francisco Escolano
CVPR
2001
IEEE
16 years 1 months ago
Bending Invariant Representations for Surfaces
Isometric surfaces share the same geometric structure also known as the `first fundamental form'. For example, all possible bending of a given surface, that include all lengt...
Asi Elad (Elbaz), Ron Kimmel
JSAC
2008
70views more  JSAC 2008»
14 years 11 months ago
LMMSE turbo equalization based on factor graphs
Abstract--In this paper, a vector-form factor graph representation is derived for intersymbol interference (ISI) channels. The resultant graphs have a tree-structure that avoids th...
Qinghua Guo, Li Ping
CVPR
2012
IEEE
13 years 2 months ago
Mode-seeking on graphs via random walks
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...
Minsu Cho, Kyoung Mu Lee