Sciweavers

284 search results - page 48 / 57
» Distributed Agreement with Optimal Communication Complexity
Sort
View
CCGRID
2006
IEEE
16 years 1 months ago
Interactive Grid-based Free-Form Shape Modeling
— Geometric shape modeling becomes increasingly complex and resource-demanding task. In this paper we propose a method to leverage the power of Grid to provide users with high-pr...
Anthony S. K. Chong, Konstantin Levinski, Alexei S...
PODC
2011
ACM
14 years 10 months ago
Coordinated consensus in dynamic networks
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
Fabian Kuhn, Rotem Oshman, Yoram Moses
EAAI
2007
154views more  EAAI 2007»
15 years 7 months ago
An agent-based approach to solve dynamic meeting scheduling problems with preferences
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deļ¬...
Ahlem Ben Hassine, Tu Bao Ho
CRYPTO
2005
Springer
106views Cryptology» more  CRYPTO 2005»
16 years 18 days ago
Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for ...
Omer Barkol, Yuval Ishai
IPPS
2009
IEEE
16 years 1 months ago
Unit disk graph and physical interference model: Putting pieces together
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
Emmanuelle Lebhar, Zvi Lotker