—In this paper we study a two-hop cooperative transmission scheme where multiple relays forward the data simultaneously using Randomized Distributed Space Time Codes (R-DSTC). We...
Ozgu Alay, Pei Liu, Yao Wang, Elza Erkip, Shivendr...
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
Stefano Leonardi, Alberto Marchetti-Spaccamela, Al...
We propose randomized techniques for speeding up Kernel Principal Component Analysis on three levels: sampling and quantization of the Gram matrix in training, randomized rounding...
Dimitris Achlioptas, Frank McSherry, Bernhard Sch&...
This is an attempt to simplify and justify the notions of deterministicand randomized reductions, an attempt to derive these notions from (more or less) rst principles.
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 ...
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
Randomized agreement protocols have been around for more than two decades. Often assumed to be inefficient due to their high expected communication and time complexities, they ha...
Henrique Moniz, Nuno Ferreira Neves, Miguel Correi...
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...