2626 search results - page 157 / 526 » The complexity of stochastic sequences |
169
click to vote
MOBIHOC
2008
ACM
16 years 6 months ago
2008
ACM
In this paper we analyze the complexity of scheduling wireless links in the physical interference model with analog network coding capability. We study two models with different d...
164
click to vote
MOBIHOC
2007
ACM
16 years 6 months ago
2007
ACM
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
150
click to vote
APLAS
2008
ACM
15 years 8 months ago
2008
ACM
Abstract. We study the problem of generating a test sequence that achieves maximal coverage for a reactive system under test. We formulate the problem as a repeated game between th...
198
click to vote
ALT
2010
Springer
15 years 6 months ago
2010
Springer
This paper is concerned with the combinatorial structure of concept classes that can be learned from a small number of examples. We show that the recently introduced notion of recu...
169
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The Jordan Curve Theorem (JCT) states that a simple closed curve divides the plane into exactly two connected regions. We formalize and prove the theorem in the context of grid gr...