644 search results - page 8 / 129 » Decomposition Complexity |
173
Voted
COLT
2007
Springer
16 years 16 days ago
2007
Springer
We present data-dependent error bounds for transductive learning based on transductive Rademacher complexity. For specific algorithms we provide bounds on their Rademacher complex...
149
Voted
DAC
2003
ACM
16 years 7 months ago
2003
ACM
Structuring and mapping of a Boolean function is an important problem in the design of complex integrated circuits. Libraryaware constructive decomposition offers a solution to th...
148
click to vote
TSP
2011
15 years 1 months ago
2011
The extension of multiple-input multiple-output (MIMO) sphere decoding from the narrowband case to wideband systems based on orthogonal frequency division multiplexing (OFDM) requ...
133
click to vote
DGCI
2006
Springer
15 years 10 months ago
2006
Springer
This paper deals with the complexity of the decomposition of a digital surface into digital plane segments (DPS for short). We prove that the decision problem (does there exist a ...
135
Voted
VLSID
2004
IEEE
16 years 6 months ago
2004
IEEE
This paper is an attempt to answer the following question: how much improvement can be obtained in logic decomposition by using Boolean divisors? Traditionally, the existence of t...