53 search results - page 4 / 11 » On the Reduction Theory for Average Case Complexity |
100
click to vote
ASPDAC
1995
ACM
15 years 1 months ago
1995
ACM
— The goal of transistor reordering for a logic gate is to reduce the propagation delay as well as the charging and discharging of internal capacitances to achieve low power cons...
COLT
2008
Springer
14 years 12 months ago
2008
Springer
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
MST
2010
14 years 8 months ago
2010
Reductions and completeness notions form the heart of computational complexity theory. Recently non-uniform reductions have been naturally introduced in a variety of settings conc...
ICC
2007
IEEE
15 years 2 months ago
2007
IEEE
Motivated by combinatorial optimization theory, we propose an algorithmic power allocation method that minimizes the total transmitting power in transmitter diversity systems, prov...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Consider a flat-fading Multiple-Input Multiple-Output (MIMO) system. The near-optimum detection problematic has been shown to be efficiently solved through QR Decomposition (QRD...