Sciweavers

4612 search results - page 879 / 923
» More Communications
Sort
View
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
14 years 1 months ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain
SPAA
2010
ACM
14 years 1 months ago
Securing every bit: authenticated broadcast in radio networks
This paper studies non-cryptographic authenticated broadcast in radio networks subject to malicious failures. We introduce two protocols that address this problem. The first, Nei...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Zark...
GECCO
2010
Springer
159views Optimization» more  GECCO 2010»
14 years 1 months ago
Evolution of division of labor in genetically homogenous groups
Within nature, the success of many organisms, including certain species of insects, mammals, slime molds, and bacteria, is attributed to their performance of division of labor, wh...
Heather Goldsby, David B. Knoester, Charles Ofria
MPC
2010
Springer
152views Mathematics» more  MPC 2010»
14 years 1 months ago
Lucy-n: a n-Synchronous Extension of Lustre
Synchronous functional languages such as Lustre or Lucid Synchrone define a restricted class of Kahn Process Networks which can be executed with no buffer. Every expression is as...
Louis Mandel, Florence Plateau, Marc Pouzet
CHI
2009
ACM
14 years 1 months ago
StoryBank: mobile digital storytelling in a development context
Mobile imaging and digital storytelling currently support a growing practice of multimedia communication in the West. In this paper we describe a project which explores their bene...
David M. Frohlich, Dorothy Rachovides, Kiriaki Rig...