7106 search results - page 203 / 1422 » Restricted Complexity, General Complexity |
121
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Guruswami and Indyk showed in [1] that Forney's error exponent can be achieved with linear coding complexity over binary symmetric channels. This paper extends this conclusion...
112
click to vote
APPML
2007
15 years 3 months ago
2007
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...
226
Voted
TOPLAS
2008
15 years 3 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
121
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
125
Voted
WSTST
2005
Springer
15 years 9 months ago
2005
Springer
: In this paper, we discuss our challenge on how to give the creatures and ability to follow spatial restriction while keeping the complexity low enough to still allow for real-tim...