13603 search results - page 288 / 2721 » On the Complexity of Computing Treelength |
177
click to vote
GLOBECOM
2007
IEEE
16 years 13 days ago
2007
IEEE
—In this paper, we present an iterative algorithm for channel complex gains estimation with inter-sub-carrierinterference (ICI) reduction in orthogonal-frequency-divisionmultiple...
136
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Σ3-complete ...
161
click to vote
COCO
2003
Springer
15 years 11 months ago
2003
Springer
We review and slightly strengthen known results on the Kolmogorov complexity of prefixes of effectively random sequences. First, there are recursively random random sequences su...
158
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
We study the complexity of the visibility map of terrains whose triangles are fat, not too steep and have roughly the same size. It is known that the complexity of the visibility ...
184
click to vote
SAC
2010
ACM
16 years 28 days ago
2010
ACM
Modern networks are very complex. It is highly desirable to reduce management complexity in next generation network design. Researchers have been seeking inspiration in natural ob...