Sciweavers

4949 search results - page 82 / 990
» Consistency and Set Intersection
Sort
View
ICPP
1997
IEEE
15 years 7 months ago
The Affinity Entry Consistency Protocol
In this paper we propose a novel software-only distributed sharedmemory system (SW-DSM), the Affinity Entry Consistency (AEC) protocol. The protocol is based on Entry Consistency ...
Cristiana Bentes Seidel, Ricardo Bianchini, Claudi...
COMPGEOM
2009
ACM
15 years 10 months ago
Near-linear approximation algorithms for geometric hitting sets
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
Pankaj K. Agarwal, Esther Ezra, Micha Sharir
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
15 years 7 months ago
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
Christoph Ambühl, Thomas Erlebach, Matú...
WWW
2008
ACM
16 years 4 months ago
Lock-free consistency control for web 2.0 applications
Online collaboration and sharing is the central theme of many webbased services that create the so-called Web 2.0 phenomena. Using the Internet as a computing platform, many Web 2...
Jiangming Yang, Haixun Wang, Ning Gu, Yiming Liu, ...
PODC
2009
ACM
16 years 4 months ago
Brief announcement: global consistency can be easier than point-to-point communication
Global consistency or Byzantine Agreement (BA) and reliable point-to-point communication are two of the most important and well-studied problems in distributed computing. Informal...
Prasant Gopal, Anuj Gupta, Pranav K. Vasishta, Piy...