Sciweavers

1132 search results - page 158 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
JCT
2011
74views more  JCT 2011»
15 years 1 months ago
Basis theorems for continuous n-colorings
This article is devoted to the study of continuous colorings of the n-element subsets of a Polish space. The homogeneity number hm(c) of an n-coloring c : [X]n → 2 is the least s...
Stefanie Frick, Stefan Geschke
MST
2011
207views Hardware» more  MST 2011»
15 years 1 months ago
Fixpoint Logics over Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Stefan Göller, Markus Lohrey
ICASSP
2011
IEEE
14 years 10 months ago
Bound-ratio minimization of filter bank frames by periodic precoding
Frame (upper and lower) bound ratio is a key factor of numerical stability of frame systems. While tight frames, of which the minimal ratio 1 is achieved, are much preferred in ma...
Li Chai, Jingxin Zhang
ICASSP
2011
IEEE
14 years 10 months ago
On the sum rate of ZF detectors over correlated K fading MIMO channels
This paper presents a detailed sum rate investigation of Zero-Forcing (ZF) detectors over composite multiple-input multiple-output (MIMO) channels. To this end, we consider the ge...
Michail Matthaiou, Nestor D. Chatzidiamantis, Geor...
ACL
2011
14 years 10 months ago
A Comparison of Loopy Belief Propagation and Dual Decomposition for Integrated CCG Supertagging and Parsing
Via an oracle experiment, we show that the upper bound on accuracy of a CCG parser is significantly lowered when its search space is pruned using a supertagger, though the supert...
Michael Auli, Adam Lopez