Sciweavers

4744 search results - page 69 / 949
» Connected Computing
Sort
View
CRYPTO
2011
Springer
207views Cryptology» more  CRYPTO 2011»
13 years 11 months ago
Secure Computation on the Web: Computing without Simultaneous Interaction
Secure computation enables mutually suspicious parties to compute a joint function of their private inputs while providing strong security guarantees. Amongst other things, even i...
Shai Halevi, Yehuda Lindell, Benny Pinkas
IPPS
2010
IEEE
14 years 9 months ago
A scalable algorithm for maintaining perpetual system connectivity in dynamic distributed systems
We investigate the problem of maintaining a topology with small degree as well as small diameter in a dynamic distributed system such that the system always stays connected and pr...
Tarun Bansal, Neeraj Mittal
ICDE
2009
IEEE
145views Database» more  ICDE 2009»
15 years 6 months ago
Context-Aware Object Connection Discovery in Large Graphs
— Given a large graph and a set of objects, the task of object connection discovery is to find a subgraph that retains the best connection between the objects. Object connection...
James Cheng, Yiping Ke, Wilfred Ng, Jeffrey Xu Yu
IWPEC
2009
Springer
15 years 6 months ago
What Makes Equitable Connected Partition Easy
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A...
SODA
2003
ACM
122views Algorithms» more  SODA 2003»
15 years 1 months ago
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
Devdatt P. Dubhashi, Alessandro Mei, Alessandro Pa...