380 search results - page 19 / 76 » A Categorical Setting for Lower Complexity |
69
Voted
TIT
2008
14 years 9 months ago
2008
In this paper, redundant random ensembles are defined and their average stopping set (SS) weight distributions are analyzed. A redundant random ensemble consists of a set of binar...
111
click to vote
CIAC
2006
Springer
15 years 1 months ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
101
click to vote
ECCC
2006
14 years 9 months ago
2006
Suppose you ran a chess tournament, everybody played everybody, and you wanted to use the results to rank everybody. Unless you were really lucky, the results would not be acyclic...
ILP
2003
Springer
15 years 2 months ago
2003
Springer
We study several complexity parameters for first order formulas and their suitability for first order learning models. We show that the standard notion of size is not captured by...
COCO
2009
Springer
15 years 4 months ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...