1485 search results - page 126 / 297 » connection 2010 |
152
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We study the two-user Gaussian multiple-input multiple-output (MIMO) broadcast channel with common and confidential messages. In this channel, the transmitter sends a common messa...
139
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over a fixed, finite structure B. This may be seen as a natural generalisation of ...
169
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Let a, b and n be nonnegative integers (b a, b > 0, n 1), Gn(a, b) be a multigraph on n vertices in which any pair of vertices is connected with at least a and at most b edges ...
138
Voted
CORR
2010
Springer
15 years 6 months ago
2010
Springer
For several semirings S, two weighted finite automata with multiplicities in S are equivalent if and only if they can be connected by a chain of simulations. Such a semiring S is c...
158
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Using Atomic Force Microscopes (AFM) to manipulate nanoobjects is an actual challenge for surface scientists. Basic haptic interfaces between the AFM and experimentalists...