767 search results - page 16 / 154 » On Clustering Using Random Walks |
EUROCOLT
1999
Springer
14 years 27 days ago
1999
Springer
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...
CPC
2004
13 years 8 months ago
2004
Using representation theory, we obtain a necessary and sufficient condition for a discrete
SACRYPT
2001
Springer
14 years 1 months ago
2001
Springer
This paper extends the analysis of Pollard’s rho algorithm for solving a single instance of the discrete logarithm problem in a finite cyclic group G to the case of solving more...
ECCV
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We propose a novel restoration method for defects and missing regions in video sequences, particularly in application to archive film restoration. Our statistical framew...
ICML
2007
IEEE
14 years 9 months ago
2007
IEEE
Ranking nodes in graphs is of much recent interest. Edges, via the graph Laplacian, are used to encourage local smoothness of node scores in SVM-like formulations with generalizat...