Sciweavers

ICASSP
2010
IEEE
13 years 4 months ago
Error resilient video multicast using Randomized Distributed Space Time Codes
—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...
SODA
1998
ACM
104views Algorithms» more  SODA 1998»
13 years 5 months ago
On-line Randomized Call Control Revisited
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...
NIPS
2001
13 years 5 months ago
Sampling Techniques for Kernel Methods
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&...
CSL
1990
Springer
13 years 8 months ago
On the Reduction Theory for Average Case Complexity
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.
Andreas Blass, Yuri Gurevich
IPPS
1998
IEEE
13 years 8 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
COMPGEOM
2003
ACM
13 years 9 months ago
Incremental constructions con BRIO
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...
Nina Amenta, Sunghee Choi, Günter Rote
GECCO
2004
Springer
119views Optimization» more  GECCO 2004»
13 years 9 months ago
Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
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...
Frank Neumann, Ingo Wegener
STOC
2004
ACM
138views Algorithms» more  STOC 2004»
13 years 9 months ago
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
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...
Gurmeet Singh Manku, Moni Naor, Udi Wieder
DSN
2006
IEEE
13 years 10 months ago
Randomized Intrusion-Tolerant Asynchronous Services
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...
STACS
2007
Springer
13 years 10 months ago
Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
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...
Robert Elsässer, Thomas Sauerwald