1243 search results - page 5 / 249 » Complexity reduction of C-Algorithm |
175
click to vote
ACMSE
2010
ACM
15 years 25 days ago
2010
ACM
The ranking problem appears in many areas of study such as customer rating, social science, economics, and information retrieval. Ranking can be formulated as a classification pro...
173
Voted
CVPR
2011
IEEE
15 years 28 days ago
2011
IEEE
In this paper, we propose a novel method to reduce the magnitude of 4D CT artifacts by stitching two images with a data-driven regularization constrain, which helps preserve the l...
141
click to vote
JCSS
1998
15 years 5 months ago
1998
We show that all sets that are complete for NP under non-uniform AC0 reductions are isomorphic under non-uniform AC0-computable isomorphisms. Furthermore, these sets remain NP-com...
135
click to vote
CSL
1990
Springer
15 years 9 months ago
1990
Springer
This is an attempt to simplify and justify the notions of deterministicand randomized reductions, an attempt to derive these notions from (more or less) rst principles.
177
click to vote
DAC
1999
ACM
15 years 10 months ago
1999
ACM
This paper presents a method to reduce the complexity of a linear or linearized (small-signal) analog circuit. The reduction technique, based on quality-error ranking, can be used...