1224 search results - page 16 / 245 » Design and Implementation of a Practical Parallel Delaunay A... |
103
click to vote
ESORICS
2004
Springer
15 years 7 months ago
2004
Springer
We evaluate the anonymity provided by two popular email mix implementations, Mixmaster and Reliable, and compare their effectiveness through the use of simulations which model th...
115
click to vote
DCOSS
2010
Springer
15 years 2 months ago
2010
Springer
In this work, we present a robust sensor fusion system for exploratory data collection, exploiting the spatial redundancy in sensor networks. Unlike prior work, our system design c...
165
Voted
PODC
2011
ACM
14 years 4 months ago
2011
ACM
Dynamic memory management is a significant source of complexity in the design and implementation of practical concurrent data structures. We study how hardware transactional memo...
121
Voted
SPAA
2004
ACM
15 years 7 months ago
2004
ACM
The literature describes two high performance concurrent stack algorithms based on combining funnels and elimination trees. Unfortunately, the funnels are linearizable but blockin...
112
Voted
ICPPW
2006
IEEE
15 years 8 months ago
2006
IEEE
Homotopy methods to solve polynomial systems are well suited for parallel computing because the solution paths defined by the homotopy can be tracked independently. For sparse po...