661 search results - page 42 / 133 » Robustness Guarantees for Anonymity |
EUROGRAPHICS
2010
Eurographics
15 years 6 months ago
2010
Eurographics
We present a new technique to implement operators that modify the topology of polygonal meshes at intersections and self-intersections. Depending on the modification strategy, th...
89
Voted
SMA
2009
ACM
15 years 4 months ago
2009
ACM
Many algorithms for shape analysis and shape processing rely on accurate estimates of differential information such as normals and curvature. In most settings, however, care must...
115
click to vote
SWAT
2010
Springer
15 years 2 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
SIGMETRICS
2006
ACM
15 years 3 months ago
2006
ACM
This work analyzes the connectivity of large diameter networks where every link has an independent probability p of failure. We give a (relatively simple) topological condition th...
DC
2010
14 years 6 months ago
2010
In this paper, we present RAMBO, an algorithm for emulating a read/write distributed shared memory in a dynamic, rapidly changing environment. RAMBO provides a highly reliable, hi...