Sciweavers

3047 search results - page 4 / 610
» Randomized Parallel Selection
Sort
View
COLCOM
2005
IEEE
14 years 1 months ago
Symbiotic multi-path routing with attractor selection
In this paper we discuss the effects of symbiosis when using an attractor selection model for multi-path routing in an overlay network. Attractor selection is a biologically inspi...
Kenji Leibnitz, Naoki Wakamiya, Masayuki Murata
SPAA
2010
ACM
13 years 7 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis
EUROPAR
2008
Springer
13 years 9 months ago
Deque-Free Work-Optimal Parallel STL Algorithms
This paper presents provable work-optimal parallelizations of STL (Standard Template Library) algorithms based on the workstealing technique. Unlike previous approaches where a deq...
Daouda Traoré, Jean-Louis Roch, Nicolas Mai...
ICMLA
2008
13 years 9 months ago
Highly Scalable SVM Modeling with Random Granulation for Spam Sender Detection
Spam sender detection based on email subject data is a complex large-scale text mining task. The dataset consists of email subject lines and the corresponding IP address of the em...
Yuchun Tang, Yuanchen He, Sven Krasser
SIGMETRICS
2010
ACM
201views Hardware» more  SIGMETRICS 2010»
14 years 10 days ago
Load balancing via random local search in closed and open systems
In this paper, we analyze the performance of random load resampling and migration strategies in parallel server systems. Clients initially attach to an arbitrary server, but may s...
Ayalvadi Ganesh, Sarah Lilienthal, D. Manjunath, A...