Sciweavers

42230 search results - page 119 / 8446
» Algorithms and Complexity Results for
Sort
View
TCOM
2010
112views more  TCOM 2010»
14 years 8 months ago
On further reduction of complexity in tree pruning based sphere search
Abstract—In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational compl...
Byonghyo Shim, Insung Kang
MIAR
2008
IEEE
15 years 4 months ago
A Surface-Based Fractal Information Dimension Method for Cortical Complexity Analysis
In this paper, we proposed a new surface-based fractal information dimension (FID) method to quantify the cortical complexity. Unlike the traditional box-counting method to measure...
Yuanchao Zhang, Jiefeng Jiang, Lei Lin, Feng Shi, ...
SSDBM
2007
IEEE
110views Database» more  SSDBM 2007»
15 years 4 months ago
On Exploring Complex Relationships of Correlation Clusters
In high dimensional data, clusters often only exist in arbitrarily oriented subspaces of the feature space. In addition, these so-called correlation clusters may have complex rela...
Elke Achtert, Christian Böhm, Hans-Peter Krie...
IWCMC
2006
ACM
15 years 3 months ago
Low complexity design of space-time convolutional codes with high spectral efficiencies
Space time convolutional codes (STCCs) are an effective way to combine transmit diversity with coding. The computational complexity of designing STCCs generally increases exponent...
Kyungmin Kim, Hamid R. Sadjadpour, Rick S. Blum, Y...
COCO
2004
Springer
106views Algorithms» more  COCO 2004»
15 years 3 months ago
Separating Complexity Classes Using Structural Properties
We study the robustness of complete sets for various complexity classes. A complete set A is robust if for any f(n)-dense set S ∈ P, A−S is still complete, where f(n) ranges f...
Harry Buhrman, Leen Torenvliet