1554 search results - page 150 / 311 » Parameterized Complexity and Approximation Algorithms |
111
click to vote
TIT
2010
14 years 10 months ago
2010
Soft-input soft-output (SISO) detection algorithms form the basis for iterative decoding. The computational complexity of SISO detection often poses significant challenges for prac...
136
Voted
ICN
2005
Springer
15 years 9 months ago
2005
Springer
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. ...
125
click to vote
CIC
2004
15 years 4 months ago
2004
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
128
click to vote
IMR
2005
Springer
15 years 9 months ago
2005
Springer
Today, finite element technologies allow engineers to analyze complex assemblies and subsystems. With CPU power constantly increasing, it is not unreasonable to state that the eng...
133
Voted
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
We consider the exact and approximate computational complexity of the multivariate LMS linear regression estimator. The LMS estimator is among the most widely used robust linear s...