Sciweavers

3047 search results - page 43 / 610
» Randomized Parallel Selection
Sort
View
IPPS
1998
IEEE
13 years 12 months ago
On Randomized and Deterministic Schemes for Routing and Sorting on Fixed-Connection Networks
Abstract. We give a high-level description of some fundamental randomized and deterministic techniques for routing and sorting on xedconnection networks such as meshes, hypercubes ...
Torsten Suel
IMCSIT
2010
13 years 2 months ago
Multi-level Parallelization with Parallel Computational Services in BeesyCluster
The paper presents a concept, implementation and real examples of dynamic parallelization of computations using services derived from MPI applications deployed in the BeesyCluster ...
Pawel Czarnul
CORR
2007
Springer
86views Education» more  CORR 2007»
13 years 7 months ago
On the Discovery of Random Trees
Abstract. We consider in this paper the problem of discovering, via a traceroute algorithm, the topology of a network, whose graph is spanned by an infinite branching process. A s...
Fabrice Guillemin, Philippe Robert
ICDCS
2009
IEEE
14 years 4 months ago
CLIQUE: Role-Free Clustering with Q-Learning for Wireless Sensor Networks
Clustering and aggregation inherently increase wireless sensor network (WSN) lifetime by collecting information within a cluster at a cluster head, reducing the amount of data thr...
Anna Förster, Amy L. Murphy
ACL
2006
13 years 9 months ago
Modelling Lexical Redundancy for Machine Translation
Certain distinctions made in the lexicon of one language may be redundant when translating into another language. We quantify redundancy among source types by the similarity of th...
David Talbot, Miles Osborne