1605 search results - page 203 / 321 » On Partitional Labelings of Graphs |
EMMCVPR
2001
Springer
14 years 2 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...
TON
2008
13 years 10 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 ...
COMBINATORICS
2002
13 years 10 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 ...
PAA
2002
13 years 9 months ago
2002
: Many classification problems involve high dimensional inputs and a large number of classes. Multiclassifier fusion approaches to such difficult problems typically centre around s...
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
We study the k-wise independent relaxation of the usual model G(N, p) of random graphs where, as in this model, N labeled vertices are fixed and each edge is drawn with probabili...