Sciweavers

50 search results - page 3 / 10
» Lattices on simplicial partitions
Sort
View
ICIP
1998
IEEE
14 years 1 months ago
Vector Set-Partitioning with Successive Refinement Voronoi Lattice VQ for Embedded Wavelet Image Coding
: While lattice vector quantization (LVQ) can solve the complexity problem of LBG based vector quantizers, and also yield very general codebooks, a single stage lattice VQ, when ap...
Debargha Mukherjee, Sanjit K. Mitra
COMBINATORICS
2002
85views more  COMBINATORICS 2002»
13 years 8 months ago
Parking Functions of Types A and B
The lattice of noncrossing partitions can be embedded into the Cayley graph of the symmetric group. This allows us to rederive connections between noncrossing partitions and parki...
Philippe Biane
ISMVL
2008
IEEE
126views Hardware» more  ISMVL 2008»
14 years 3 months ago
Betweenness, Metrics and Entropies in Lattices
We investigate a class of metrics on lattices that are compatible with the partial order defined by the lattice using the ternary relation of betweenness that can be naturally de...
Dan A. Simovici
JAT
2010
63views more  JAT 2010»
13 years 7 months ago
Symmetric box-splines on the A*n lattice
Sampling and reconstruction of generic multivariate functions is more efficient on non-Cartesian root lattices, such as the BCC (Body-Centered Cubic) lattice, than on the Cartesia...
Minho Kim, Jörg Peters
COMBINATORICS
2000
61views more  COMBINATORICS 2000»
13 years 8 months ago
Where the Typical Set Partitions Meet and Join
The lattice of the set partitions of [n] ordered by refinement is studied. Suppose r partitions p1, . . . , pr are chosen independently and uniformly at random. The probability tha...
Boris Pittel