767 search results - page 35 / 154 » On Clustering Using Random Walks |
102
click to vote
BMVC
2001
15 years 4 months ago
2001
This paper describes a spectral method for graph-matching. We adopt a graphical models viewpoint in which the graph adjacency matrix is taken to represent the transition probabili...
106
Voted
SDM
2007
SIAM
15 years 3 months ago
2007
SIAM
We propose the use of random projections with a sparse matrix to maintain a sketch of a collection of high-dimensional data-streams that are updated asynchronously. This sketch al...
104
click to vote
ICPR
2010
IEEE
15 years 5 months ago
2010
IEEE
Pattern recognition problems often suffer from the larger intra-class variation due to situation variations such as pose, walking speed, and clothing variations in gait recognition...
183
click to vote
AAAI
2011
14 years 2 months ago
2011
Inspired by “GoogleTM Sets” and Bayesian sets, we consider the problem of retrieving complex objects and relations among them, i.e., ground atoms from a logical concept, given...
126
Voted
CIKM
2010
Springer
15 years 14 days ago
2010
Springer
We describe efficient techniques for construction of large term co-occurrence graphs, and investigate an application to the discovery of numerous fine-grained (specific) topics. A...