-
Hardware architectures for successive cancellation decoding of polar codes
International audience -
Graphs decompositions: some limites and obstructions
Graphs decompositions of small width are usually used to solve efficiently problems which are difficult in general. In this thesis, we focus on some limits of these... -
Motion planning with pulley, rope, and baskets
International audience -
Stronger Lower Bounds and Randomness-Hardness Trade-Offs Using Associated Alg...
International audience -
Constant compression and random weights
International audience -
Statistical Decision Making Method for Cognitive Radio
This work is about developing a decision making method, based on statistical modeling, for a cognitive radio receiver. By characterizing statistically the radio... -
Min-max and min-max (relative) regret approaches to representatives selection...
International audience -
Scenario Based Robust Line Balancing: Computational Complexity
International audience -
On computing the 2-diameter-constrained K-reliability of networks
International audience -
On the Kolmogorov-Chaitin Complexity for short sequences
A drawback to Kolmogorov-Chaitin complexity (K) is that it is uncomputable in general, and that limits its range of applicability. Moreover when strings are short, the... -
On the Algorithmic Nature of the World
We propose a test based on the theory of algorithmic complexity and an experimental evaluation of Levin's universal distribution to identify evidence in support of or... -
Complejidad descriptiva y computacional en máquinas de Turing pequeñas
International audience -
Program-size versus Time Complexity Slowdown and Speed-up Phenomena in the Mi...
3rd International Workshop on Physics and Computation, Egypt, August 30-SEP 06, 2010 -
A low-complexity soft-decision decoding architecture for the binary extended ...
International audience -
Rank: a tool to check program termination and computational complexity
International audience -
Projection Onto The k-Cosparse Set is NP-Hard
International audience -
Low Space Complexity Multiplication over Binary Fields with Dickson Polynomia...
International audience -
Reducing the Receiver's Computation Complexity by Limiting the Use of the Bea...
International audience
