Sciweavers

162 search results - page 21 / 33
» A Simple and Efficient Implementation of Concurrent Local Ta...
Sort
View
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
14 years 9 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
ECOOP
1998
Springer
14 years 1 months ago
Cyclic Distributed Garbage Collection with Group Merger
This paper presents a new algorithm for distributed garbage collection and outlines its implementation within the Network Objects system. The algorithm is based on a reference list...
Helena Rodrigues, Richard E. Jones
MM
2010
ACM
186views Multimedia» more  MM 2010»
13 years 9 months ago
Hybrid load balancing for online games
As massively multiplayer online games are becoming very popular, how to support a large number of concurrent users while maintaining the game performance has become an important r...
Rynson W. H. Lau
ICDE
2010
IEEE
241views Database» more  ICDE 2010»
14 years 8 months ago
FlexPref: A Framework for Extensible Preference Evaluation in Database Systems
Personalized database systems give users answers tailored to their personal preferences. While numerous preference evaluation methods for databases have been proposed (e.g., skylin...
Justin J. Levandoski, Mohamed F. Mokbel, Mohamed E...
ADHOC
2006
97views more  ADHOC 2006»
13 years 9 months ago
A probabilistic algorithm for efficient and robust data propagation in wireless sensor networks
We study the problem of data propagation in sensor networks, comprised of a large number of very small and low-cost nodes, capable of sensing, communicating and computing. The dis...
Ioannis Chatzigiannakis, Tassos Dimitriou, Sotiris...