1093 search results - page 128 / 219 » Clustering from Constraint Graphs |
115
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
This paper presents a novel approach of multiple target tracking from multiple collaborative cameras. Firstly, particle filtering for conditional density propagation on graphs to...
172
Voted
IPCV
2008
15 years 5 months ago
2008
Minimum spanning tree algorithms have been proposed for the lossy compression of image sets. In these algorithms, a complete graph is constructed from the entire image set and an ...
144
click to vote
HIS
2009
15 years 1 months ago
2009
Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...
116
Voted
ICDM
2010
IEEE
15 years 1 months ago
2010
IEEE
An idealized clustering algorithm seeks to learn a cluster-adjacency matrix such that, if two data points belong to the same cluster, the corresponding entry would be 1; otherwise ...
128
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...