Sciweavers

543 search results - page 28 / 109
» A Randomized Parallel Sorting Algorithm with an Experimental...
Sort
View
126
Voted
PPOPP
2012
ACM
13 years 9 months ago
Internally deterministic parallel algorithms can be fast
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...
150
Voted
LATIN
2010
Springer
15 years 9 months ago
Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization
Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful n...
Dominik Gall, Riko Jacob, Andréa W. Richa, ...
ESA
2008
Springer
92views Algorithms» more  ESA 2008»
15 years 4 months ago
How Reliable Are Practical Point-in-Polygon Strategies?
We experimentally study the reliability of geometric software for point location in simple polygons. As expected, the code we tested works very well for random query points. Howeve...
Stefan Schirra
ICDCSW
2003
IEEE
15 years 7 months ago
A Study of the Performance and Parameter Sensitivity of Adaptive Distributed Caching
A self-organized approach to manage a distributed proxy system called Adaptive Distributed Caching (ADC) has been proposed previously. We model each proxy as an autonomous agent th...
Markus J. Kaiser, Kwok Ching Tsui, Jiming Liu
160
Voted
KDD
2012
ACM
235views Data Mining» more  KDD 2012»
13 years 4 months ago
A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data
Outlier mining in d-dimensional point sets is a fundamental and well studied data mining task due to its variety of applications. Most such applications arise in high-dimensional ...
Ninh Pham, Rasmus Pagh