10988 search results - page 159 / 2198 » Algorithmic Folding Complexity |
142
click to vote
COCOON
2003
Springer
15 years 8 months ago
2003
Springer
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...
140
Voted
GLOBECOM
2008
IEEE
15 years 10 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...
134
Voted
ACMSE
2000
ACM
15 years 7 months ago
2000
ACM
We present the background and justi cation for a new approachto studying computation and computational complexity. We focus on categories of problems and categories of solutions w...
121
click to vote
COMPGEOM
2008
ACM
15 years 5 months ago
2008
ACM
We investigate the complexity of the outer face in arrangements of line segments of a fixed length in the plane, drawn uniformly at random within a square. We derive upper bounds ...
124
Voted
ASPDAC
2007
ACM
15 years 7 months ago
2007
ACM
- 3D IC technologies can help to improve circuit performance and lower power consumption by reducing wirelength. Also, 3D IC technology can be used to realize heterogeneous system-...