14699 search results - page 459 / 2940 » Complexity and Cognitive Computing |
157
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The concept of effective complexity of an object as the minimal description length of its regularities has been initiated by Gell-Mann and Lloyd. The regularities are modeled by m...
277
click to vote
SIGMOD
2006
ACM
16 years 7 months ago
2006
ACM
Recently, there has been extensive research that generated a wealth of new XML full-text query languages, ranging from simple Boolean search to combining sophisticated proximity a...
162
click to vote
MFCS
2004
Springer
16 years 6 days ago
2004
Springer
We study constructive and resource-bounded scaled dimension as an information content measure and obtain several results that parallel previous work on unscaled dimension. Scaled ...
290
click to vote
POPL
2008
ACM
16 years 7 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
201
click to vote
GLOBECOM
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— In this paper, we propose a low complexity Maximum Likelihood (ML) decoding algorithm for orthogonal spacetime block codes (OSTBCs) based on the real-valued lattice rep...