Sciweavers

2436 search results - page 417 / 488
» Comonadic Notions of Computation
Sort
View
PODC
2010
ACM
14 years 1 months ago
Eventually linearizable shared objects
Linearizability is the strongest known consistency property of shared objects. In asynchronous message passing systems, Linearizability can be achieved with 3S and a majority of c...
Marco Serafini, Dan Dobre, Matthias Majuntke, P&ea...
EUROCAST
2007
Springer
122views Hardware» more  EUROCAST 2007»
14 years 1 months ago
Generation of Indexes for Compiling Efficient Parsers from Formal Specifications
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
Carlos Gómez-Rodríguez, Miguel A. Al...
GRID
2007
Springer
14 years 1 months ago
Global-scale peer-to-peer file services with DFS
The global inter-networking infrastructure that has become essential for contemporary day-to-day computing and communication tasks, has also enabled the deployment of several large...
Antony Chazapis, Georgios Tsoukalas, Georgios Veri...
FOCS
2004
IEEE
14 years 1 months ago
Triangulation and Embedding Using Small Sets of Beacons
Concurrent with recent theoretical interest in the problem of metric embedding, a growing body of research in the networking community has studied the distance matrix defined by n...
Jon M. Kleinberg, Aleksandrs Slivkins, Tom Wexler
DCOSS
2006
Springer
14 years 1 months ago
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Rav...