280 search results - page 13 / 56 » New Algorithms for Enumerating All Maximal Cliques |
JSAC
2006
14 years 9 months ago
2006
Abstract--The current framework of network utility maximization for rate allocation and its price-based algorithms assumes that each link provides a fixed-size transmission "p...
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
We consider boosting algorithms that maintain a distribution over a set of examples. At each iteration a weak hypothesis is received and the distribution is updated. We motivate t...
KDD
2010
ACM
14 years 11 months ago
2010
ACM
Influence maximization, defined by Kempe, Kleinberg, and Tardos (2003), is the problem of finding a small set of seed nodes in a social network that maximizes the spread of influe...
GBRPR
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. We present a new method (MIDES) to determine contraction kernels for the construction of graph pyramids. Experimentally the new method has a reduction factor higher than ...
NETWORKS
2011
14 years 4 months ago
2011
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...