Search

Search Funnelback University

Search powered by Funnelback
1 - 10 of 37 search results for TALK:PC53 20 |u:www-sigproc.eng.cam.ac.uk where 0 match all words and 37 match some words.
  1. Results that match 1 of 2 words

  2. 1 Rewritable Storage Channels with Hidden StateRamji Venkataramanan,…

    www-sigproc.eng.cam.ac.uk/foswiki/pub/Main/RV285/rew_jsac_final.pdf
    21 Jan 2014: them equal probability, the rate is. I(XT ;Y ) = I(T;Y ) = H(T) = log(Nκ) (20). ... 9, no. 1, pp. 19–31, 1980. [20] M. Costa, “Writing on dirty paper (corresp.),” IEEE Trans.
  3. 1 Robust Pairwise Matching of Interest Points withComplex Wavelets ...

    www-sigproc.eng.cam.ac.uk/foswiki/pub/Main/NGK/TIP_Ng_EeSin_manuscript_shortened.pdf
    2 Jul 2014: We also compare the proposed algorithm with theHough transform algorithm in [4], [20]. ... 3) An algorithm based on the proposed algorithm in [4],[20] (hough-sift).
  4. 2398 IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 22, NO. ...

    www-sigproc.eng.cam.ac.uk/foswiki/pub/Main/NGK/Anantrasirichai_etal_TransIP-June_2013.pdf
    27 Jun 2014: Existing no-reference assess-ment (NR) methods [20]–[23] are tested with our simulatedsequences. ... It attempts to align imagequality with HVS perception by characterising blockinessand blurring [20].
  5. 3254 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 60, NO. ...

    www-sigproc.eng.cam.ac.uk/foswiki/pub/Main/RV285/sparc_ml_IT_Trans_June14.pdf
    18 May 2014: Inf. Theory, vol. 43, no. 1, pp. 38–47, Jan. 1997. [20] D. ... Inf. Theory, vol. 20, no. 2, pp. 197–199, Mar. 1974. [28] S.
  6. 3F1InfoTheory

    www-sigproc.eng.cam.ac.uk/foswiki/pub/Main/3F1/3F1InfoTheory.pdf
    27 Apr 2014: 17. 2.4 Shannon Fano Coding. 18. 2.5 Huffman Coding. 20. 2.6 Extension Coding. ... 20 3F1 Information Theory Course - Section 2. 2.5 Huffman Coding.
  7. 3F6_10_Testing.key

    www-sigproc.eng.cam.ac.uk/foswiki/pub/Main/3F6/3F6_10_Testing.pdf
    28 Feb 2014: increased sample sizes in usability testing” showed that 5 users do not necessarily deliver 85% problem discovery but a set of 20 was certainly very reliable! • ... Increasing the number tested to 20 can allow the. practitioner to approach increasing
  8. 3F6_11_SoftDevMethodologies.key

    www-sigproc.eng.cam.ac.uk/foswiki/pub/Main/3F6/3F6_11_SoftDevMethodologies.pdf
    28 Feb 2014: They also defined 12 Principles! 20. 2012-2013 Elena Punskaya Cambridge University Engineering Department.
  9. 3F6_2_OO_Basics_filled in.key

    www-sigproc.eng.cam.ac.uk/foswiki/pub/Main/3F6/3F6_2_OO_Basics.pdf
    31 Jan 2014: placed in m[52]10100 0 0000000000 0 43:! S data 20<<12 Space character11000 0 0000000000 0 44: &S data 24<<12 Line feed character10010 0 0000000000 0 45: @S
  10. 3F6_3_UML new.key

    www-sigproc.eng.cam.ac.uk/foswiki/pub/Main/3F6/3F6_3_UML.pdf
    31 Jan 2014: 20. 2012-2013 Elena Punskaya Cambridge University Engineering Department. Sequence Diagram• Consider the drawing Editor example!". ". ". ". •
  11. 3F6_5_Design_Patterns.key

    www-sigproc.eng.cam.ac.uk/foswiki/pub/Main/3F6/3F6_5_Design_Patterns.pdf
    4 Feb 2014: They said they had failed, because they were only able to use 20. ... 20. Originator createMemento setMemento. Memento getState setState. Caretakerhistorycreates. 2012-2013 Elena Punskaya Cambridge University Engineering Department.

Refine your results

Search history

Recently clicked results

Recently clicked results

Your click history is empty.

Recent searches

Recent searches

Your search history is empty.