767 search results - page 41 / 154 » On Clustering Using Random Walks |
194
click to vote
ICML
2003
IEEE
16 years 3 months ago
2003
IEEE
An approach to semi-supervised learning is proposed that is based on a Gaussian random field model. Labeled and unlabeled data are represented as vertices in a weighted graph, wit...
119
click to vote
ECCC
2006
15 years 2 months ago
2006
Ahlswede and Winter [AW02] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound for real-valued random...
110
click to vote
INFOCOM
2006
IEEE
15 years 8 months ago
2006
IEEE
— While structured P2P systems (such as DHTs) are often regarded as an improvement over unstructured P2P systems (such as super-peer networks) in terms of routing efficiency, it...
137
click to vote
PAMI
2008
15 years 2 months ago
2008
This paper introduces three new contributions to the problems of image classification and image search. First, we propose a new image patch quantization algorithm. Other competitiv...
135
click to vote
MA
2010
Springer
15 years 25 days ago
2010
Springer
This paper deals with the quantization problem of a random variable X taking values in a separable and re exive Banach space, and with the related question of clustering independ...