767 search results - page 21 / 154 » On Clustering Using Random Walks |
SAT
2005
Springer
14 years 2 months ago
2005
Springer
Many current local search algorithms for SAT fall into one of two classes. Random walk algorithms such as Walksat/SKC, Novelty+ and HWSAT are very successful but can be trapped for...
FOCS
2003
IEEE
14 years 1 months ago
2003
IEEE
We consider a model of learning Boolean functions from examples generated by a uniform random walk on {0, 1}n . We give a polynomial time algorithm for learning decision trees and...
COLING
2010
13 years 3 months ago
2010
Fact collections are mostly built using semi-supervised relation extraction techniques and wisdom of the crowds methods, rendering them inherently noisy. In this paper, we propose...
KDD
2006
ACM
14 years 9 months ago
2006
ACM
Recommender systems are an emerging technology that helps consumers find interesting products and useful resources. A recommender system makes personalized product suggestions by e...
KDD
2010
ACM
14 years 16 days ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...