526 search results - page 34 / 106 » Increments of Random Partitions |
ARSCOM
2004
13 years 8 months ago
2004
The domatic number of a graph G is the maximum number of dominating sets into which the vertex set of G can be partitioned. We show that the domatic number of a random r-regular g...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
ICML
2005
IEEE
14 years 9 months ago
2005
IEEE
We introduce flexible algorithms that can automatically learn mappings from images to actions by interacting with their environment. They work by introducing an image classifier i...
PAKDD
2010
ACM
13 years 10 months ago
2010
ACM
Abstract. Finding correlation clusters in the arbitrary subspaces of highdimensional data is an important and a challenging research problem. The current state-of-the-art correlati...
COLT
2007
Springer
14 years 2 months ago
2007
Springer
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...