CORR
2010
Springer
13 years 6 months ago
2010
Springer
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We exhibit the rich structure of the set of correlated equilibria by analyzing the simplest of polynomial games: the mixed extension of matching pennies. We show that while the co...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We introduce the radio reconfigurability thanks to IRUWB mostly digital architecture for MANET context. This particular context implies some constraints on the radio interface suc...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We prove a variant of a Johnson-Lindenstrauss lemma for matrices with circulant structure. This approach allows to minimise the randomness used, is easy to implement and provides ...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
The usual way to investigate the statistical properties of finitely generated subgroups of free groups, and of finite presentations of groups, is based on the so-called word-based ...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
It has been asserted previously by the author that optimal control theory can be a valuable framework for theoretical studies about the shape that a wind instrument should have in...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
CORR
2010
Springer
13 years 6 months ago
2010
Springer
There are at least two ways to interpret numerical degrees of belief in terms of betting:
CORR
2010
Springer
13 years 6 months ago
2010
Springer
In the context of the current financial crisis, when more companies are facing bankruptcy or insolvency, the paper aims to find methods to identify distressed firms by using finan...