3600 search results - page 75 / 720 » The settling-time reducibility ordering |
161
click to vote
DSD
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper focuses on numerical function generators (NFGs) based on k-th order polynomial approximations. We show that increasing the polynomial order k reduces significantly the...
227
click to vote
JMLR
2010
15 years 1 months ago
2010
Identifying a subset of features that preserves classification accuracy is a problem of growing importance, because of the increasing size and dimensionality of real-world data se...
187
click to vote
JMLR
2010
15 years 1 months ago
2010
In this paper, we consider two variance reduction schemes that exploit the structure of the primal graph of the graphical model: Rao-Blackwellised w-cutset sampling and AND/OR sam...
286
click to vote
ORL
2011
15 years 1 months ago
2011
We derive a convex relaxation for cardinality constrained Principal Component Analysis (PCA) by using a simple representation of the L1 unit ball and standard Lagrangian duality. ...
189
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Recognizer Output Voting Error Reduction (ROVER), is a well-known procedure for decoders’ combination aiming at reducing the Word Error Rate (WER) in transcription applications....