Sciweavers

1675 search results - page 219 / 335
» Implementing Data Cubes Efficiently
Sort
View
123
Voted
ICPP
2009
IEEE
15 years 1 months ago
Employing Transactional Memory and Helper Threads to Speedup Dijkstra's Algorithm
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...
Konstantinos Nikas, Nikos Anastopoulos, Georgios I...
MOBISYS
2008
ACM
16 years 3 months ago
Micro power management of active 802.11 interfaces
Wireless interfaces are major power consumers on mobile systems. Considerable research has improved the energy efficiency of elongated idle periods or created more elongated idle ...
Jiayang Liu, Lin Zhong
131
Voted
ESA
2008
Springer
99views Algorithms» more  ESA 2008»
15 years 5 months ago
Robust Kinetic Convex Hulls in 3D
Abstract. Kinetic data structures provide a framework for computing combinatorial properties of continuously moving objects. Although kinetic data structures for many problems have...
Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, ...
163
Voted
USS
2010
15 years 1 months ago
P4P: Practical Large-Scale Privacy-Preserving Distributed Computation Robust against Malicious Users
In this paper we introduce a framework for privacypreserving distributed computation that is practical for many real-world applications. The framework is called Peers for Privacy ...
Yitao Duan, NetEase Youdao, John Canny, Justin Z. ...
HIPS
1998
IEEE
15 years 7 months ago
Constructive and Adaptable Distributed Shared Memory
Distributed shared memory (DSM) is a paradigm for programming distributed systems, which provides an alternative to the message passing model. DSM offers the agents of the system ...
Jordi Bataller, José M. Bernabéu-Aub...