Sciweavers

142 search results - page 14 / 29
» Near-perfect Token Distribution
Sort
View
ENC
2004
IEEE
14 years 1 months ago
Graph-Based Point Relaxation for 3D Stippling
Point hierarchies are suitable for creating framecoherent animations of 3D models in non-photorealistic styles such as stippling, painterly and other artistic rendering. In this p...
Oscar Meruvia Pastor, Thomas Strotthote
JGAA
2006
120views more  JGAA 2006»
13 years 9 months ago
Distributing Unit Size Workload Packages in Heterogeneous Networks
The task of balancing dynamically generated work load occurs in a wide range of parallel and distributed applications. Diffusion based schemes, which belong to the class of neares...
Robert Elsässer, Burkhard Monien, Stefan Scha...
SIGIR
2009
ACM
14 years 4 months ago
Addressing morphological variation in alphabetic languages
The selection of indexing terms for representing documents is a key decision that limits how effective subsequent retrieval can be. Often stemming algorithms are used to normaliz...
Paul McNamee, Charles K. Nicholas, James Mayfield
SODA
2010
ACM
197views Algorithms» more  SODA 2010»
14 years 7 months ago
Quasirandom Load Balancing
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
Tobias Friedrich, Martin Gairing, Thomas Sauerwald
DC
2007
13 years 9 months ago
Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
We present a randomizedself-stabilizing leaderelection protocol and a randomizedself-stabilizing token circulation protocol under an arbitrary scheduler on anonymous and unidirect...
Joffroy Beauquier, Maria Gradinariu, Colette Johne...