Sciweavers

929 search results - page 27 / 186
» On Computation and Communication with Small Bias
Sort
View
ICNP
2003
IEEE
14 years 1 months ago
Establishing Pairwise Keys for Secure Communication in Ad Hoc Networks: A Probabilistic Approach
A prerequisite for secure communication between two nodes in an ad hoc network is that the nodes share a key to bootstrap their trust relationship. In this paper, we present a sca...
Sencun Zhu, Shouhuai Xu, Sanjeev Setia, Sushil Jaj...
MHCI
2005
Springer
14 years 2 months ago
Searching common experience: a social communication tool based on mobile ad-hoc networking
As small digital cameras become more popular, opportunities to take photos are rapidly increasing. Photo sharing is a great way to maintain and revitalize relationships between fa...
Michimune Kohno, Jun Rekimoto
EUROPAR
2009
Springer
14 years 16 days ago
Fast and Efficient Synchronization and Communication Collective Primitives for Dual Cell-Based Blades
The Cell Broadband Engine (Cell BE) is a heterogeneous multi-core processor specifically designed to exploit thread-level parallelism. Its memory model comprehends a common shared ...
Epifanio Gaona, Juan Fernández, Manuel E. A...
STOC
2005
ACM
144views Algorithms» more  STOC 2005»
14 years 9 months ago
Pseudorandom generators for low degree polynomials
We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite fields F. Our main construction gives a generator with se...
Andrej Bogdanov
WABI
2005
Springer
143views Bioinformatics» more  WABI 2005»
14 years 2 months ago
A Faster Algorithm for Detecting Network Motifs
Motifs in a network are small connected subnetworks that occur in significantly higher frequencies than in random networks. They have recently gathered much attention as a useful ...
Sebastian Wernicke