Sciweavers

43 search results - page 8 / 9
» MinISO: A Minimal Independent System Operator
Sort
View
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 7 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
IMC
2003
ACM
14 years 19 days ago
Tomography-based overlay network monitoring
Overlay network monitoring enables distributed Internet applications to detect and recover from path outages and periods of degraded performance within seconds. For an overlay net...
Yan Chen, David Bindel, Randy H. Katz
TPLP
2002
117views more  TPLP 2002»
13 years 7 months ago
On Properties of Update Sequences Based on Causal Rejection
In this paper, we consider an approach to update nonmonotonic knowledge bases represented as extended logic programs under the answer set semantics. In this approach, new informat...
Thomas Eiter, Michael Fink, Giuliana Sabbatini, Ha...
APGV
2007
ACM
115views Visualization» more  APGV 2007»
13 years 11 months ago
A roughness measure for 3D mesh visual masking
3D models are subject to a wide variety of processing operations such as compression, simplification or watermarking, which introduce slight geometric modifications on the shape. ...
Guillaume Lavoué
HPDC
2007
IEEE
14 years 1 months ago
A statistical approach to risk mitigation in computational markets
We study stochastic models to mitigate the risk of poor Quality-of-Service (QoS) in computational markets. Consumers who purchase services expect both price and performance guaran...
Thomas Sandholm, Kevin Lai