1480 search results - page 250 / 296 » Distributed algorithms for weighted problems in sparse graph... |
142
click to vote
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...
140
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
The key ideas behind most of the recently proposed Markov networks based EDAs were to factorise the joint probability distribution in terms of the cliques in the undirected graph....
160
click to vote
ECCC
2011
14 years 9 months ago
2011
A family of permutations in Sn is k-wise independent if a uniform permutation chosen from the family maps any distinct k elements to any distinct k elements equally likely. Effici...
141
click to vote
SIGIR
2005
ACM
15 years 8 months ago
2005
ACM
In this paper we use a Unified Relationship Matrix (URM) to represent a set of heterogeneous data objects (e.g., web pages, queries) and their interrelationships (e.g., hyperlinks...
173
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...