Search
Search Funnelback University
- Refined by:
- Date: 2020
11 -
20 of
20
search results for KaKaoTalk:po03 op |u:www.dpmms.cam.ac.uk
where 0
match all words and 20
match some words.
Results that match 1 of 2 words
-
1922 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. ...
https://www.dpmms.cam.ac.uk/~ik355/PAPERS/generalJ.pdf5 Jun 2020: Gray and Linder show that op-timum high-rate performance for mean-squared distortion canbe achieved even if the quantizer codebook is mismatched withrespect to the source (specifically, if it is -
PubTeX output 1999.09.27:1044
https://www.dpmms.cam.ac.uk/~ik355/PAPERS/lossyJ.pdf5 Jun 2020: C. Implementation Issues and Simulation Results. As stated in Theorem 1, the algorithm converges to op-timality if the rate at which the databases are refinedtends to infinity while tends to -
nits-NL_0312.indd
https://www.dpmms.cam.ac.uk/~ik355/PAPERS/NLMarch12.pdf5 Jun 2020: capacity but near-op-timal codes. -
Source coding, large deviations, and approximate pattern matching -…
https://www.dpmms.cam.ac.uk/~ik355/PAPERS/TRJ.pdf5 Jun 2020: 1590 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 6, JUNE 2002. Source Coding, Large Deviations, and ApproximatePattern Matching. Amir Dembo and Ioannis Kontoyiannis, Member, IEEE. Invited Paper. Dedicated to the memory of Aaron Wyner, a -
Source coding exponents for zero-delay coding with finite memory -…
https://www.dpmms.cam.ac.uk/~ik355/PAPERS/expsJ.pdf5 Jun 2020: For the subclassof zero-delay codes, Ericson [4] and Gaarder and Slepian [5],[6] have shown that optimal performance is achieved by op-timal (Lloyd–Max) scalar quantization for the given -
hyb.dvi
https://www.dpmms.cam.ac.uk/~ik355/PAPERS/hyb.pdf5 Jun 2020: Complexity-Compression Tradeoffs in Lossy Compression. via Efficient Random Codebooks and Databases. Christos Gioran, Ioannis Kontoyiannis, †‡. Abstract. The compression-complexity trade-off of lossy compression algorithms that are based on a -
Progresswe search and retrieval I I I In large ...
https://www.dpmms.cam.ac.uk/~ik355/PAPERS/ibmrndJ.pdf5 Jun 2020: Progresswe search and retrieval I I I In large Image arch wes. by V. Castelli L. D. Bergman I. Kontoyiannis C.-S. Li J. T. Robinson J. J. Turek. In this paper, we describe the architecture and implementation of a framework to perform content-based -
CONSTRUCTING THE COTANGENT COMPLEX VIA HOMOTOPICAL ALGEBRA RONG ZHOU…
https://www.dpmms.cam.ac.uk/~rz240/Model_categories.pdf22 Oct 2020: CONSTRUCTING THE COTANGENT COMPLEX VIA. HOMOTOPICAL ALGEBRA. RONG ZHOU. Contents. 1. Introduction 11.1. Notations and Conventions 32. Definition of a Model Category 33. The Homotopy Category 54. Examples: Topological spaces and chain complexes 145. -
Geometric Group TheoryLectures by Ana KhukhroNotes by Alexis Marchand …
https://www.dpmms.cam.ac.uk/~aptm3/docs/lecture-notes/PartIII-GeometricGroupTheory.pdf10 Mar 2020: Remark 5.30. Consider the closure of the class of finite groups and abelian groups under the op-erations of Proposition 5.20; this is called the class of elementary amenable -
Category TheoryLectures by Peter JohnstoneNotes by Alexis Marchand…
https://www.dpmms.cam.ac.uk/~aptm3/docs/lecture-notes/PartIII-CategoryTheory.pdf8 Jun 2020: ii) We have a functor op : Cat Cat, with the identity operation on morphisms. ... C [C, Set] Y1 [C, Set]op [C, Set] [C,Set](,) Set,. where Cop Y [C, Set] is the Yoneda embedding, given by A 7 C (A,).
Search history
Recently clicked results
Recently clicked results
Your click history is empty.
Recent searches
Recent searches
Your search history is empty.