Closest point search in lattices
In this semitutorial paper, a comprehensive survey of closest point search methods for
lattices without a regular structure is presented. The existing search strategies are described …
lattices without a regular structure is presented. The existing search strategies are described …
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
In this article, we give an overview of efficient algorithms for the approximate and exact
nearest neighbor problem. The goal is to preprocess a dataset of objects (eg, images) so …
nearest neighbor problem. The goal is to preprocess a dataset of objects (eg, images) so …
Hawkes processes for events in social media
This chapter provides an accessible introduction for point processes, and especially Hawkes
processes, for modeling discrete, inter-dependent events over continuous time. We start by …
processes, for modeling discrete, inter-dependent events over continuous time. We start by …
Locality sensitive hashing: A comparison of hash function types and querying mechanisms
It is well known that high-dimensional nearest neighbor retrieval is very expensive. Dramatic
performance gains are obtained using approximate search schemes, such as the popular …
performance gains are obtained using approximate search schemes, such as the popular …
Deep learning for video classification and captioning
Deep learning for video classification and captioning Page 1 IPART MULTIMEDIA
CONTENT ANALYSIS Page 2 Page 3 1Deep Learning for Video Classification and …
CONTENT ANALYSIS Page 2 Page 3 1Deep Learning for Video Classification and …
Multiple-description vector quantization with lattice codebooks: Design and analysis
VA Vaishampayan, NJA Sloane… - IEEE Transactions on …, 2001 - ieeexplore.ieee.org
The problem of designing a multiple-description vector quantizer with lattice codebook/spl
Lambda/is considered. A general solution is given to a labeling problem which plays a …
Lambda/is considered. A general solution is given to a labeling problem which plays a …
Minimal tail-biting trellises: The Golay code and more
AR Calderbank, GD Forney… - IEEE Transactions on …, 1999 - ieeexplore.ieee.org
Tail-biting trellis representations of block codes are investigated. We develop some
elementary theory, and present several intriguing examples, which we hope will stimulate …
elementary theory, and present several intriguing examples, which we hope will stimulate …
Optimal sectionalization of a trellis
A Lafourcade, A Vardy - IEEE Transactions on Information …, 1996 - ieeexplore.ieee.org
While the complexity of trellis decoding for a given block code is essentially a function of the
number of states and branches in its trellis, the decoding complexity may be often reduced …
number of states and branches in its trellis, the decoding complexity may be often reduced …
Gaussian source coding with spherical codes
J Hamkins, K Zeger - IEEE Transactions on Information Theory, 2002 - ieeexplore.ieee.org
A fixed-rate shape-gain quantizer for the memoryless Gaussian source is proposed. The
shape quantizer is constructed from wrapped spherical codes that map a sphere packing …
shape quantizer is constructed from wrapped spherical codes that map a sphere packing …
Query adaptative locality sensitive hashing
It is well known that high-dimensional nearest-neighbor retrieval is very expensive. Many
signal processing methods suffer from this computing cost. Dramatic performance gains can …
signal processing methods suffer from this computing cost. Dramatic performance gains can …