13603 search results - page 333 / 2721 » On the Complexity of Computing Treelength |
308
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...
174
click to vote
IEEEARES
2010
IEEE
16 years 2 months ago
2010
IEEE
- An operational complexity model (OCM) is proposed to enable the complexity of both the cognitive and the computational components of a process to be determined. From the complexi...
180
Voted
MFCS
2004
Springer
16 years 25 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 ...
321
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...
229
Voted
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...