13603 search results - page 341 / 2721 » On the Complexity of Computing Treelength |
188
click to vote
VTC
2006
IEEE
16 years 1 months ago
2006
IEEE
– In this paper, a partial sphere decoding approach is proposed to reduce the computational complexity of implementing the iterative MAP receiver for spatial multiplexing system,...
164
click to vote
VTC
2006
IEEE
16 years 1 months ago
2006
IEEE
— Iterative equalization has emerged as an efficient means of achieving near-capacity detection performance in multiple-antenna (MIMO) systems. However, many proposed detection ...
169
Voted
ATAL
2005
Springer
16 years 1 months ago
2005
Springer
In this paper, we present an online method for POMDPs, called RTBSS (Real-Time Belief Space Search), which is based on a look-ahead search to find the best action to execute at e...
206
click to vote
MFCS
2004
Springer
16 years 26 days ago
2004
Springer
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
209
click to vote
COLT
2003
Springer
16 years 22 days ago
2003
Springer
This paper studies sequence prediction based on the monotone Kolmogorov complexity Km=−log m, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomon...