Results 1  10
of
164
Modelling Equidistant Frequency Permutation Arrays in Constraints
"... Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each symbol occurs the same number of times in each codeword. The problem is to find a set of codewords such that any pair of ..."
Abstract
 Add to MetaCart
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each symbol occurs the same number of times in each codeword. The problem is to find a set of codewords such that any pair
Modelling Equidistant Frequency Permutation Arrays: An Application of Constraints to Mathematics
"... Abstract Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each symbol occurs the same number of times in each codeword. The problem is to find a set of codewords such that an ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
Abstract Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each symbol occurs the same number of times in each codeword. The problem is to find a set of codewords
Kruskal’s permutation lemma and the identification of Candecomp/Parafac and bilinear models with constant modulus constraints
 IEEE Trans. Signal Process
"... Abstract—CANDECOMP/PARAFAC (CP) analysis is an extension of lowrank matrix decomposition to higherway arrays, which are also referred to as tensors. CP extends and unifies several array signal processing tools and has found applications ranging from multidimensional harmonic retrieval and angleca ..."
Abstract

Cited by 48 (6 self)
 Add to MetaCart
interesting application of the Permutation Lemma, we derive a similar necessary and sufficient condition for unique bilinear factorization under constant modulus (CM) constraints, thus providing an interesting link to (and unification with) CP. Index Terms—CANDECOMP, constant modulus, identifiablity, PARAFAC
Efficient inference for distributions on permutations
 Advances in Neural Information Processing Systems
, 2008
"... Permutations are ubiquitous in many real world problems, such as voting, rankings and data association. Representing uncertainty over permutations is challenging, since there are n! possibilities, and typical compact representations such as graphical models cannot efficiently capture the mutual excl ..."
Abstract

Cited by 22 (6 self)
 Add to MetaCart
exclusivity constraints associated with permutations. In this paper, we use the “lowfrequency” terms of a Fourier decomposition to represent such distributions compactly. We present Kronecker conditioning, a general and efficient approach for maintaining these distributions directly in the Fourier domain
Fourier Theoretic Probabilistic Inference over Permutations
 JOURNAL OF MACHINE LEARNING RESEARCH
, 2009
"... Permutations are ubiquitous in many realworld problems, such as voting, ranking, and data association. Representing uncertainty over permutations is challenging, since there are n! possibilities, and typical compact and factorized probability distribution representations, such as graphical models, ..."
Abstract

Cited by 29 (7 self)
 Add to MetaCart
, cannot capture the mutual exclusivity constraints associated with permutations. In this paper, we use the “lowfrequency” terms of a Fourier decomposition to represent distributions over permutations compactly. We present Kronecker conditioning, a novel approach for maintaining and updating
Stochastic modeling of California ground motions
"... Abstract Groundmotion relations are developed for California using a stochastic simulation method that exploits the equivalence between finitefault models and a twocorner pointsource model of the earthquake spectrum. First, stochastic simulations are generated for finitefault ruptures, in orde ..."
Abstract

Cited by 50 (11 self)
 Add to MetaCart
, in order to define the average shape and amplitude level of the radiated spectrum at nearsource distances as a function of earthquake size. The length and width of the fault plane are defined based on the moment magnitude of the earthquake and modeled with an array of subfaults. The radiation from each
Thesis Proposal Probabilistic Reasoning with Permutations: A FourierTheoretic Approach
, 2008
"... the degree of Doctor of Philosophy. Permutations are ubiquitous in many realworld problems, such as voting, ranking, and data association. Representing uncertainty over permutations is challenging, since there are n! possibilities, and common factorized probability distribution representations, suc ..."
Abstract
 Add to MetaCart
, such as graphical models, are inefficient due to the mutual exclusivity constraints that are typically associated with permutations. This thesis explores a new approach for probabilistic reasoning with permutations based on the idea of approximating distributions using their lowfrequency Fourier components. We use
Convolutive Blind Speech Separation using Cross Spectral Density Matrix and Clustering for Resolving Permutation
"... The problem of separation of audio sources recorded in a real world situation is well established in modern literature. The method to solve this problem is Blind Speech Separation (BSS).The recording environment is usually modeled as convolutive (i.e. number of speech sources should be equal to or l ..."
Abstract
 Add to MetaCart
to or less than number of microphone arrays). In this paper, we propose a new frequency domain approach to convolutive blind speech separation. Matrix Diagonalization method is applied on cross power spectral density matrices of the microphone inputs to determine the mixing system at each frequency bin up
Beamforming and interference canceling with very large wideband arrays
 IEEE Trans
, 2003
"... Abstract—Future radio telescopes are envisioned to be beamforming arrays containing hundreds to millions of elements distributed over thousands of km2, with bandwidths that are 10% or more of the RF center frequency. It is awkward to analyze such systems using traditional narrowband beamforming the ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
theory. This paper presents a frequencydomain model that includes relevant features such as true time delay, distributed doppler effects, and nonideal instrumental frequency response. Conventional beamforming—i.e., maximizing the gain in a certain direction subject to no other constraints—is analyzed
Self calibration for the LOFAR radio astronomical array
 IEEE Tr. Signal Processing
, 2007
"... Abstract—LOFAR is a lowfrequency radio astronomical array currently under development in The Netherlands. It is designed to produce synthesis images of the most distant celestial objects yet observed. Due to high redshift levels, observations must be at unusually low frequencies (30–240 MHz), over ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
incorporate a variety of constraining signal models. It is shown that although the unconstrained direction dependent calibration problem is ambiguous, physically justifiable constraints can be applied in LOFAR to yield viable solutions. Use of a “compact core ” of closely spaced array elements as part
Results 1  10
of
164