823 search results - page 105 / 165 » Brick partitions of graphs |
193
click to vote
KDD
2007
ACM
16 years 6 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...
186
click to vote
PKDD
2010
Springer
15 years 4 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
176
click to vote
EMMCVPR
2001
Springer
15 years 10 months ago
2001
Springer
Most cost function based clustering or partitioning methods measure the compactness of groups of data. In contrast to this picture of a point source in feature space, some data sou...
219
click to vote
TON
2008
15 years 6 months ago
2008
Abstract-- This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number ...
144
click to vote
COMBINATORICS
2002
15 years 6 months ago
2002
We consider Kasteleyn and Kasteleyn-Percus matrices, which arise in enumerating matchings of planar graphs, up to matrix operations on their rows and columns. If such a matrix is ...