Sciweavers

2519 search results - page 31 / 504
» Martingales and Locality in Distributed Computing
Sort
View
PERCOM
2008
ACM
14 years 8 months ago
An Algorithm for Distributed Beacon Selection
This paper investigates wireless sensor networks where a small percentage of nodes are assumed to know their location a priori. These reference nodes enable absolute localization ...
Dominik Lieckfeldt, Jiaxi You, Dirk Timmermann
EUC
2006
Springer
14 years 10 days ago
Data-Layout Optimization Using Reuse Distance Distribution
As the ever-increasing gap between the speed of processor and the speed of memory has become the cause of one of primary bottlenecks of computer systems, modern architecture system...
Xiong Fu, Yu Zhang, Yiyun Chen
PODC
1996
ACM
14 years 25 days ago
Fundamental Challenges in Mobile Computing
This paper is an answer to the question: "What is unique and conceptually different about mobile computing?" The paper begins by describing a set of constraints intrinsi...
Mahadev Satyanarayanan
PODS
2009
ACM
136views Database» more  PODS 2009»
14 years 9 months ago
Distributed XML design
A distributed XML document is an XML document that spans several machines or Web repositories. We assume that a distribution design of the document tree is given, providing an XML...
Serge Abiteboul, Georg Gottlob, Marco Manna
SPAA
2009
ACM
14 years 9 months ago
An optimal local approximation algorithm for max-min linear programs
In a max-min LP, the objective is to maximise subject to Ax 1, Cx 1, and x 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorith...
Patrik Floréen, Joel Kaasinen, Petteri Kask...