Sciweavers

2863 search results - page 439 / 573
» Constructing minimum-interference networks
Sort
View
EUROCRYPT
2012
Springer
13 years 5 months ago
Fully Homomorphic Encryption with Polylog Overhead
We show that homomorphic evaluation of (wide enough) arithmetic circuits can be accomplished with only polylogarithmic overhead. Namely, we present a construction of fully homomorp...
Craig Gentry, Shai Halevi, Nigel P. Smart
DIALM
2003
ACM
139views Algorithms» more  DIALM 2003»
15 years 8 months ago
dBBlue: low diameter and self-routing bluetooth scatternet
This paper addresses the problem of scatternet formation for singlehop Bluetooth based ad hoc networks, with minimal communication overhead. We adopt the well-known structure de B...
Wen-Zhan Song, Xiang-Yang Li, Yu Wang 0003, Weizha...
118
Voted
TCC
2009
Springer
132views Cryptology» more  TCC 2009»
16 years 3 months ago
Authenticated Adversarial Routing
: The aim of this paper is to demonstrate the feasibility of authenticated throughput-ecient routing in an unreliable and dynamically changing synchronous network in which the majo...
Yair Amir, Paul Bunn, Rafail Ostrovsky
147
Voted
RECOMB
2005
Springer
16 years 3 months ago
Decomposition of Overlapping Protein Complexes: A Graph Theoretical Method for Analyzing Static and Dynamic Protein Associations
Background: Most cellular processes are carried out by multi-protein complexes, groups of proteins that bind together to perform a specific task. Some proteins form stable complex...
Elena Zotenko, Katia S. Guimarães, Raja Jot...
WSDM
2010
ACM
227views Data Mining» more  WSDM 2010»
16 years 21 days ago
Folks in folksonomies: Social link prediction from shared metadata
Web 2.0 applications have attracted a considerable amount of attention because their open-ended nature allows users to create lightweight semantic scaffolding to organize and shar...
Rossano Schifanella, Alain Barrat, Ciro Cattuto, B...