Search
Search Funnelback University
- Refined by:
- Date: 2013
1 -
10 of
16
search results for KaKaoTalk:po03 op |u:www-sigproc.eng.cam.ac.uk
where 0
match all words and 16
match some words.
Results that match 1 of 2 words
-
Optimization of LDPC Codesfor Receiver Frontends Gottfried Lechner,…
www-sigproc.eng.cam.ac.uk/foswiki/pub/Main/JS851/isit2006-lechner-sayir-land.pdf11 Sep 2013: Designing the degree distributions of an LDPC code tomatch a given frontend is a nontrivial task, since the op-timization problem is nonlinear, and therefore, search algo-rithms have to be -
International Symposium on Information Theory and its Applications,…
www-sigproc.eng.cam.ac.uk/foswiki/pub/Main/JS851/isitalechnersayir.pdf11 Sep 2013: We present an op-timal non-linear post-processing function of the checknode outputs that achieves this bound. ... 1] Jinghu Chen and Marc P. C. Fossorier, “Near op-timum universal belief propagation based decodingof low-density parity check codes,” -
DESIGN OF Q-SHIFT COMPLEX WAVELETS FOR IMAGE PROCESSINGUSING…
www-sigproc.eng.cam.ac.uk/foswiki/pub/Main/NGK/ngk_icip03a.pdf5 Aug 2013: This pa-per describes a new and effective design technique for op-timizing the Q-shift filters, particularly for image process-ing applications where linear-phase is an important prop-erty ... 4. RESULTS. Figures 4 and 5 show the frequency responses of -
eus00.dvi
www-sigproc.eng.cam.ac.uk/foswiki/pub/Main/NGK/pl_eus00.pdf5 Aug 2013: Therefore the redundancy atthe output is still 2:1. For 2-D signals, the two trees first op-erate on the rows and then the columns of the data. -
RESTORATION OF IMAGES AND 3D DATA TO HIGHER RESOLUTIONBY ...
www-sigproc.eng.cam.ac.uk/foswiki/pub/Main/NGK/zhang_ICIP_2010.pdf5 Aug 2013: ȳ = D(Hx) n̄ (1). Then the problem can be expressed as recovery of the higher-sampled x from ȳ, with known PSF H and subsampling op-eration D according to -
icip03sparsity.dvi
www-sigproc.eng.cam.ac.uk/foswiki/pub/Main/NGK/ngk_icip03b.pdf5 Aug 2013: 4] H Bölcskei and F Hlawatsch, “Oversampled filter banks: Op-timal noise shaping, design freedom, and noise analysis,” inICASSP 97, April 1997, pp. -
ripple_suppress2.dvi
www-sigproc.eng.cam.ac.uk/foswiki/pub/Main/NGK/Nelson_IOA.pdf5 Aug 2013: transform, togetherwith multiple instances of fully sampled matched filter op-erations (at each scale level) is computationally expensive.It is also unclear as to how the vertical, horizontal, anddiagonal subbands are -
Lossy Compression via Sparse Linear Regression:Computationally…
www-sigproc.eng.cam.ac.uk/foswiki/pub/Main/RV285/isit13_final.pdf5 Aug 2013: Though these techniques have good empiricalperformance, they have not been proven to attain the op-. -
MULTI-SCALE KERNEL METHODS FOR CLASSIFICATION Nick Kingsbury∗, David…
www-sigproc.eng.cam.ac.uk/foswiki/pub/Main/NGK/Kingsbury_MLSP05.pdf5 Aug 2013: The Karush-Kuhn-Tucker (KKT) conditions require that, at the op-timum solution, each term of the summation on the right-hand sideof (3) is zero, and this is achieved byλi -
TCOM-09-0115.dvi
www-sigproc.eng.cam.ac.uk/foswiki/pub/Main/RV285/TCOM_July10.pdf5 Aug 2013: While these formulas are considerablysimpler than optimizing over all policies, they are not op-timizations over finite-dimensional spaces, and are difficultto compute.
Search history
Recently clicked results
Recently clicked results
Your click history is empty.
Recent searches
- Economics lesson |u:www.homerton.cam.ac.uk (9) · moments ago
Recent searches
Your search history is empty.