Publications related to Lee distance

Symbol-Pair Codes: Algebraic Constructions and Asymptotic Bounds

For the recently proposed model of symbol-pair channels, we advance the pair-error coding theory with algebraic cyclic-code constructions and asymptotic bounds on code rates. Cyclic codes for pair-errors are constructed by a careful use of duals of known t ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

Valuable Detours: Least-Cost Anypath Routing

Martin Vetterli, Matthias Grossglauser, Henri Julien Dubois-Ferrière

In many networks, it is less costly to transmit a packet to any node in a set of neighbors than to one specific neighbor. This observation was previously exploited by opportunistic routing protocols by using single-path routing metrics to assign to each no ...

2011

An entropy inequality for q-ary random variables and its application to channel polarization

Eren Sasoglu

It is shown that given two copies of a q-ary input channel W, where q is prime, it is possible to create two channels W- and W+ whose symmetric capacities satisfy I(W-)

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

BRIEF: Binary Robust Independent Elementary Features

Pascal Fua, Vincent Lepetit, Christoph Strecha, Michael Calonder

We propose to use binary strings as an efficient feature point descriptor, which we call BRIEF. We show that it is highly discriminative even when using relatively few bits and can be computed using simple intensity difference tests. Furthermore, the descr ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

LDAHash: Improved matching with smaller descriptors

Pascal Fua, Christoph Strecha

SIFT-like local feature descriptors are ubiquitously employed in such computer vision applications as content-based retrieval, video analysis, copy detection, object recognition, photo-tourism and 3D reconstruction. Feature descriptors can be designed to b ...

2010

A Distance Model for Rhythms

Samy Bengio, Jean-François Paiement

Modeling long-term dependencies in time series has proved very difficult to achieve with traditional machine learning methods. This problem occurs when considering music data. In this paper, we introduce a model for rhythms based on the distributions of di ...

2008

A Distance Model for Rhythms

Samy Bengio, Jean-François Paiement

Modeling long-term dependencies in time series has proved very difficult to achieve with traditional machine learning methods. This problem occurs when considering music data. In this paper, we introduce a model for rhythms based on the distributions of di ...

IDIAP2008

Least-Cost Opportunistic Routing

Martin Vetterli, Matthias Grossglauser, Henri Julien Dubois-Ferrière

In opportunistic routing, each node maintains a group of candidate next-hops to reach a particular destination, and transmits packets to any node in this group. The choice of candidate next-hops at each node is a key question that is central to the perform ...

2007

A Generative Model for Rhythms

Samy Bengio, Jean-François Paiement

Modeling music involves capturing long-term dependencies in time series, which has proved very difficult to achieve with traditional statistical methods. The same problem occurs when only considering rhythms. In this paper, we introduce a generative model ...

2007

A Generative Model for Rhythms

Samy Bengio, Jean-François Paiement

Modeling music involves capturing long-term dependencies in time series, which has proved very difficult to achieve with traditional statistical methods. The same problem occurs when only considering rhythms. In this paper, we introduce a generative model ...

IDIAP2007

Lee distance

Graph Chatbot

Chat with Graph Search

Symbol-Pair Codes: Algebraic Constructions and Asymptotic Bounds

Valuable Detours: Least-Cost Anypath Routing

An entropy inequality for q-ary random variables and its application to channel polarization

BRIEF: Binary Robust Independent Elementary Features

LDAHash: Improved matching with smaller descriptors

A Distance Model for Rhythms

A Distance Model for Rhythms

Least-Cost Opportunistic Routing

A Generative Model for Rhythms

A Generative Model for Rhythms

A Distance Model for Rhythms

A Distance Model for Rhythms

Least-Cost Opportunistic Routing

A Generative Model for Rhythms

A Generative Model for Rhythms

BRIEF: Binary Robust Independent Elementary Features

Symbol-Pair Codes: Algebraic Constructions and Asymptotic Bounds

Valuable Detours: Least-Cost Anypath Routing

An entropy inequality for q-ary random variables and its application to channel polarization

LDAHash: Improved matching with smaller descriptors