Sciweavers

2638 search results - page 112 / 528
» Random Geometric Complexes
Sort
View
146
Voted
JSAC
2011
116views more  JSAC 2011»
14 years 11 months ago
Low Complexity Outage Optimal Distributed Channel Allocation for Vehicle-to-Vehicle Communications
—Due to the potential of enhancing traffic safety, protecting environment, and enabling new applications, vehicular communications, especially vehicle-to-vehicle (V2V) communica...
Bo Bai, Wei Chen, Khaled Ben Letaief, Zhigang Cao
TCS
2010
14 years 11 months ago
Parametric random generation of deterministic tree automata
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential l...
Pierre-Cyrille Héam, Cyril Nicaud, Sylvain ...
FSTTCS
1991
Springer
15 years 8 months ago
Randomizing Reductions of Search Problems
This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustne...
Andreas Blass, Yuri Gurevich
CEE
2007
67views more  CEE 2007»
15 years 4 months ago
Turbo equalization for block fading MIMO channels using random signal mapping
We present a novel turbo equalization scheme for block fading MIMO channels, where diversity is achieved using random signal mapping. We show that the computational complexity of ...
Richard Demo Souza, Javier Garcia-Frias, Renato da...
62
Voted
CORR
2010
Springer
39views Education» more  CORR 2010»
15 years 2 months ago
Non-redundant random generation from weighted context-free languages
We address the non-redundant random generation of k words of length n from a context-free language. Additionally, we want to avoid a predefined set of words. We study the limits of...
Yann Ponty