1554 search results - page 118 / 311 » Parameterized Complexity and Approximation Algorithms |
141
click to vote
GLOBECOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—One of the key factors underlying the popularity of Low-density parity-check (LDPC) code is its iterative decoding algorithm that is amenable to efficient hardware implementati...
128
Voted
KDD
2006
ACM
16 years 4 months ago
2006
ACM
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
140
Voted
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
126
Voted
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
—New air interfaces are currently being developed to meet the high spectral efficiency requirements of the emerging wireless communication systems. In this context, OFDM is cons...
122
Voted
WDAG
1990
Springer
15 years 7 months ago
1990
Springer
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...