Sciweavers

849 search results - page 32 / 170
» Network-Aware Distributed Computing: A Case Study
Sort
View
COLCOM
2005
IEEE
14 years 1 months ago
Stochasticity of probabilistic systems: analysis methodologies case-study
We do a case study of two different analysis techniques for studying the stochastic behavior of a randomized system/algorithms: (i) The first approach can be broadly termed as a ...
Anwitaman Datta, Martin Hasler, Karl Aberer
JPDC
2006
134views more  JPDC 2006»
13 years 7 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
PAKDD
2010
ACM
182views Data Mining» more  PAKDD 2010»
13 years 11 months ago
Computation of Ratios of Secure Summations in Multi-party Privacy-Preserving Latent Dirichlet Allocation
In this paper, we focus our attention on the problem of computing the ratio of two numbers, both of which are the summations of the private numbers distributed in different parties...
Bin Yang, Hiroshi Nakagawa
FSTTCS
1992
Springer
13 years 11 months ago
Structural Average Case Complexity
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
Rainer Schuler, Tomoyuki Yamakami
ICDCS
2011
IEEE
12 years 7 months ago
Authorized Private Keyword Search over Encrypted Data in Cloud Computing
—In cloud computing, clients usually outsource their data to the cloud storage servers to reduce the management costs. While those data may contain sensitive personal information...
Ming Li, Shucheng Yu, Ning Cao, Wenjing Lou