8728 search results - page 132 / 1746 » On Reduct Construction Algorithms |
95
Voted
ICFP
2003
ACM
16 years 24 days ago
2003
ACM
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
— For Orthogonal Frequency-Division Multiplexing (OFDM) systems, Peak to Average Power Ratio (PAPR) can be a major impediment to efficient transmission due to the need to use in...
76
Voted
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
— Lattice Reduction (LR) aided MIMO detection has been shown to provide near-optimal hard outputs. However soft outputs are required in practical systems to fully exploit gains f...
117
Voted
ICDM
2002
IEEE
15 years 5 months ago
2002
IEEE
It is well-known that for high dimensional data clustering, standard algorithms such as EM and the K-means are often trapped in local minimum. Many initialization methods were pro...
115
Voted
COCOON
2006
Springer
15 years 4 months ago
2006
Springer
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...