1480 search results - page 168 / 296 » Distributed algorithms for weighted problems in sparse graph... |
127
click to vote
ADMA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Crawling the deep web often requires the selection of an appropriate set of queries so that they can cover most of the documents in the data source with low cost. This ca...
174
Voted
CORR
2010
Springer
15 years 24 days ago
2010
Springer
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under node degree bounds, i.e., the number of neighbors a node can simultaneously connect to is ...
182
Voted
BIRTHDAY
2011
Springer
14 years 21 days ago
2011
Springer
Abstract. Risk analysis has been used to manage the security of systems for several decades. However, its use has been limited to offline risk computation and manual response. In c...
127
click to vote
STOC
2010
ACM
15 years 5 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
IPPS
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract—In this paper we consider the problem of constructing minimal cycle-breaking sets of turns for graphs that model communication networks, as a method to prevent deadlocks...