10988 search results - page 134 / 2198 » Algorithmic Folding Complexity |
102
click to vote
ICASSP
2008
IEEE
15 years 9 months ago
2008
IEEE
We propose a new low complexity and fast converging frequencydomain adaptive algorithm for sparse system identification. This is achieved by exploiting the MMax and SP tap-select...
124
Voted
DCC
2008
IEEE
16 years 2 months ago
2008
IEEE
We propose an algorithm which is an improved version of the Kabatiansky-Tavernier list decoding algorithm for the second order binary Reed-Muller code RM(2, m), of length n = 2m , ...
148
Voted
COMPGEOM
2008
ACM
15 years 4 months ago
2008
ACM
The Delaunay triangulation and its dual the Voronoi diagram are ubiquitous geometric complexes. From a topological standpoint, the connection has recently been made between these ...
139
Voted
MOBIHOC
2008
ACM
16 years 2 months ago
2008
ACM
It has been an important research topic since 1992 to maximize stability region in constrained queueing systems, which includes the study of scheduling over wireless ad hoc networ...
126
click to vote
DAM
1999
15 years 2 months ago
1999
Acyclic cubical complexes have first been introduced by Bandelt and Chepoi in analogy to acyclic simplicial complexes. They characterized them by cube contraction and elimination ...