681 search results - page 22 / 137 » General Polynomial Time Decomposition Algorithms |
110
Voted
STOC
2005
ACM
15 years 6 months ago
2005
ACM
We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a...
125
Voted
ICC
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
121
Voted
IWOCA
2010
Springer
14 years 7 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
115
Voted
TWC
2010
14 years 7 months ago
2010
Abstract--We prove that maximum-likelihood (ML) noncoherent sequence detection of orthogonal space-time block coded signals can always be performed in polynomial time with respect ...
102
Voted
NIPS
2004
15 years 1 months ago
2004
Linear Discriminant Analysis (LDA) is a well-known method for feature extraction and dimension reduction. It has been used widely in many applications such as face recognition. Re...