Sciweavers

961 search results - page 99 / 193
» Significance-Driven Graph Clustering
Sort
View
ICALP
1992
Springer
15 years 8 months ago
On Nearest-Neighbor Graphs
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
Mike Paterson, F. Frances Yao
ICDM
2009
IEEE
152views Data Mining» more  ICDM 2009»
15 years 2 months ago
A Sparsification Approach for Temporal Graphical Model Decomposition
Temporal causal modeling can be used to recover the causal structure among a group of relevant time series variables. Several methods have been developed to explicitly construct te...
Ning Ruan, Ruoming Jin, Victor E. Lee, Kun Huang
KDD
2012
ACM
200views Data Mining» more  KDD 2012»
13 years 7 months ago
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
David F. Gleich, C. Seshadhri
CVPR
2012
IEEE
13 years 6 months ago
Video segmentation by tracing discontinuities in a trajectory embedding
Our goal is to segment a video sequence into moving objects and the world scene. In recent work, spectral embedding of point trajectories based on 2D motion cues accumulated from ...
Katerina Fragkiadaki, Geng Zhang, Jianbo Shi
SMI
2010
IEEE
188views Image Analysis» more  SMI 2010»
15 years 2 months ago
Sharp Feature Detection in Point Clouds
—This paper presents a new technique for detecting sharp features on point-sampled geometry. Sharp features of different nature and possessing angles varying from obtuse to acute...
Christopher Weber, Stefanie Hahmann, Hans Hagen