5606 search results - page 524 / 1122 » Randomization Techniques for Graphs. |
246
click to vote
APPROX
2000
Springer
15 years 11 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
288
click to vote
ISCA
2002
IEEE
15 years 6 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
206
click to vote
CIKM
2010
Springer
15 years 1 months ago
2010
Springer
Recent advances in data processing have enabled the generation of large and complex graphs. Many researchers have developed techniques to investigate informative structures within...
178
click to vote
MCAM
2007
Springer
16 years 1 months ago
2007
Springer
In this paper, we present an optimized topology maintenance framework used in AVStreamer P2P media streaming system. To help new incoming clients get an initial view of the whole n...
190
click to vote
CIS
2005
Springer
16 years 13 days ago
2005
Springer
Abstract. As a novel research direction, privacy-preserving data mining (PPDM) has received a great deal of attentions from more and more researchers, and a large number of PPDM al...