523 search results - page 88 / 105 » Improved Approximation Algorithms for Maximum Graph Partitio... |
ICDCN
2009
Springer
14 years 6 days ago
2009
Springer
Wireless sensor networks with multiple users collecting data directly from the sensors have many potential applications. An important problem is to allocate for each user a query r...
ALT
2010
Springer
13 years 9 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
IDA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We present a Bayesian treatment of non-negative matrix factorization (NMF), based on a normal likelihood and exponential priors, and derive an efficient Gibbs sampler to ...
MP
2006
13 years 7 months ago
2006
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...