688 search results - page 71 / 138 » General Partitioning on Random Graphs |
108
Voted
EJC
2008
15 years 17 days ago
2008
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
115
Voted
KDD
2010
ACM
15 years 4 months 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...
127
click to vote
MOBICOM
2003
ACM
15 years 5 months ago
2003
ACM
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
94
Voted
ICDM
2003
IEEE
15 years 5 months ago
2003
IEEE
A data set can be clustered in many ways depending on the clustering algorithm employed, parameter settings used and other factors. Can multiple clusterings be combined so that th...
132
click to vote
KDD
2010
ACM
15 years 4 months ago
2010
ACM
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...