Sciweavers

5005 search results - page 80 / 1001
» The Design and Analysis of Parallel Algorithms
Sort
View
PODC
2009
ACM
15 years 5 months ago
Brief announcement: locality-based aggregate computation in wireless sensor networks
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...
Jen-Yeu Chen, Gopal Pandurangan, Jianghai Hu
103
Voted
CRYPTO
2010
Springer
110views Cryptology» more  CRYPTO 2010»
15 years 1 months ago
An Efficient and Parallel Gaussian Sampler for Lattices
At the heart of many recent lattice-based cryptographic schemes is a polynomial-time algorithm that, given a `high-quality' basis, generates a lattice point according to a Ga...
Chris Peikert
71
Voted
CW
2004
IEEE
15 years 4 months ago
Transmedial Worlds - Rethinking Cyberworld Design
In this paper we introduce the concept of transmedial worlds, relating it to genre and adaptation theory, and presenting a framework for how to look for transmedial traits in a wo...
Lisbeth Klastrup, Susana Pajares Tosca
117
Voted
ICDE
2009
IEEE
142views Database» more  ICDE 2009»
14 years 10 months ago
Parallel Skyline Computation on Multicore Architectures
With the advent of multicore processors, it has become imperative to write parallel programs if one wishes to exploit the next generation of processors. This paper deals with skyli...
Sungwoo Park, Taekyung Kim, Jonghyun Park, Jinha K...
92
Voted
PODC
2009
ACM
16 years 1 months ago
Bounding the locality of distributed routing algorithms
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
Prosenjit Bose, Paz Carmi, Stephane Durocher