Results 1  10
of
6,420
Parallel Cluster Identification for Multidimensional Lattices
 IEEE Transactions on Parallel and Distributed Systems
, 1995
"... The cluster identification problem is a variant of connected component labeling that arises in cluster algorithms for spin models in statistical physics. We present a multidimensional version of Belkhale and Banerjee's Quad algorithm for connected component labeling on distributed memory parall ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
The cluster identification problem is a variant of connected component labeling that arises in cluster algorithms for spin models in statistical physics. We present a multidimensional version of Belkhale and Banerjee's Quad algorithm for connected component labeling on distributed memory
A Robust Data Hiding Technique using Multidimensional Lattices
 In: Procs. of the IEEE Forum on Research and Technology Advances in Image Processing
, 1998
"... We describe a data hiding technique which uses noiseresilient channel codes based on multidimensional lattices. A tradeoff between the quantity of hidden data and the quality of the watermarked image is achieved by varying the number of quantization levels for the signature and a scale factor for d ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
We describe a data hiding technique which uses noiseresilient channel codes based on multidimensional lattices. A tradeoff between the quantity of hidden data and the quality of the watermarked image is achieved by varying the number of quantization levels for the signature and a scale factor
Implementing data cubes efficiently
 In SIGMOD
, 1996
"... Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data as multidimensional data cubes. Each cell of the data cube is a view consisting of an aggregation of interest, like total ..."
Abstract

Cited by 548 (1 self)
 Add to MetaCart
Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data as multidimensional data cubes. Each cell of the data cube is a view consisting of an aggregation of interest, like
On a Class of HighGirth LDPC Codes Based on Finite Multidimensional Lattices
"... An LDPC code construction technique is proposed based on the structural properties of finite mdimensional lattices. The Tanner graph of any code from this class is shown to have a girth of eight, and the number of proper eightcycles in the graph is enumerated. The minimum distance of the codes is s ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
An LDPC code construction technique is proposed based on the structural properties of finite mdimensional lattices. The Tanner graph of any code from this class is shown to have a girth of eight, and the number of proper eightcycles in the graph is enumerated. The minimum distance of the codes
Error Performance of Multidimensional Lattice Constellations Part II: Evaluation over Fading Channels
, 2012
"... ar ..."
Materialized View Selection in a Multidimensional Database
, 1997
"... A multidimensional database is a data repository that supports the efficient execution of complex business decision queries. Query response can be significantly improved by storing an appropriate set of materialized views. These views are selected from the multidimensional lattice whose elements rep ..."
Abstract

Cited by 146 (1 self)
 Add to MetaCart
A multidimensional database is a data repository that supports the efficient execution of complex business decision queries. Query response can be significantly improved by storing an appropriate set of materialized views. These views are selected from the multidimensional lattice whose elements
Multidimensional quadrilateral lattices are integrable
, 1996
"... The notion of multidimensional quadrilateral lattice is introduced. It is shown that such a lattice is characterized by a system of integrable discrete nonlinear equations. Different useful formulations of the system are given. The geometric construction of the lattice is also discussed and, in part ..."
Abstract

Cited by 55 (22 self)
 Add to MetaCart
The notion of multidimensional quadrilateral lattice is introduced. It is shown that such a lattice is characterized by a system of integrable discrete nonlinear equations. Different useful formulations of the system are given. The geometric construction of the lattice is also discussed and
Lattice Points In Multidimensional Bodies
, 1998
"... Asymptotic expansions for the number of lattice points in bounded regions of the ddimensional Euclidean space are obtained. We assume that the regions are level sets of polynomials of degree p ≥ 2. The expansions are valid provided that some 'local' bounds on trigonometric sums rel ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Asymptotic expansions for the number of lattice points in bounded regions of the ddimensional Euclidean space are obtained. We assume that the regions are level sets of polynomials of degree p ≥ 2. The expansions are valid provided that some 'local' bounds on trigonometric sums
Interaction of modulated pulses in scalar multidimensional nonlinear lattices
, 2009
"... We investigate the macroscopic dynamics of sets of an arbitrary finite number of weakly amplitudemodulated pulses in a multidimensional lattice of particles. The latter are assumed to exhibit scalar displacement under pairwise, arbitraryrange, nonlinear interaction potentials and are embedded in a ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We investigate the macroscopic dynamics of sets of an arbitrary finite number of weakly amplitudemodulated pulses in a multidimensional lattice of particles. The latter are assumed to exhibit scalar displacement under pairwise, arbitraryrange, nonlinear interaction potentials and are embedded
Results 1  10
of
6,420