نتایج جستجو برای: permutation method

تعداد نتایج: 1642729  

2005
Michael E. O’Sullivan John Brevik Rich Wolski

We experiment with variations of a method for constructing low-density paritycheck codes to investigate the effect on decoding performance under the sumproduct algorithm. The method uses circulant permutation matrices or affine permutation matrices as building blocks. We have developed an algorithm to choose these matrices so as to maximize the girth of the parity-check matrix. Substantial perf...

2003
Pando Georgiev Andrzej Cichocki

We give conditions under which we can solve precisely the Blind Source Separation problem (BSS) in the underdetermined case (less sensors than sources) uniquely, up to permutation and scaling of sources. Under this conditions, which include information about sparseness of the sources (and hence we call the problem sparse component analysis (SCA)), we can 1) identify the mixing matrix (up to sca...

2004
Ryo Mukai Hiroshi Sawada Shoko Araki Shoji Makino

This paper presents a method for solving the permutation problem of frequency domain blind source separation (BSS) when the number of source signals is large, and the potential source locations are omnidirectional. We propose a combination of small and large spacing sensor pairs with various axis directions in order to obtain proper geometric information for solving the permutation problem. Exp...

Journal: :Electr. J. Comb. 2010
Jeffrey B. Remmel Manda Riehl

A large number of generating functions for permutation statistics can be obtained by applying homomorphisms to simple symmetric function identities. In particular, a large number of generating functions involving the number of descents of a permutation σ, des(σ), arise in this way. For any given finite set S of positive integers, we develop a method to produce similar generating functions for t...

2004
Simone Severini Gregor Tanner

We introduce the concept of regular quantum graphs and construct connected quantum graphs with discrete symmetries. The method is based on a decomposition of the quantum propagator in terms of permutation matrices which control the way incoming and outgoing channels at vertex scattering processes are connected. Symmetry properties of the quantum graph as well as its spectral statistics depend o...

Journal: :Nuclear Physics B 2002

Journal: :Journal of Combinatorial Theory, Series A 1976

Journal: :The Electronic Journal of Combinatorics 2006

Journal: :Spatio-temporal image analysis for longitudinal and time-series image data : Second International Workshop, STIA 2012, held in conjunction with MICCAI 2012, Nice, France, October 1, 2012, proceedings. STIA (Conference) (2nd : 2012 : Nic... 2012
Manasi Datar Prasanna Muralidharan Abhishek Kumar Sylvain Gouttard Joseph Piven Guido Gerig Ross T. Whitaker P. Thomas Fletcher

In this paper, we propose a new method for longitudinal shape analysis that fits a linear mixed-effects model, while simultaneously optimizing correspondences on a set of anatomical shapes. Shape changes are modeled in a hierarchical fashion, with the global population trend as a fixed effect and individual trends as random effects. The statistical significance of the estimated trends are evalu...

2010
Michele Scarpiniti Francesco Di Palma Raffaele Parisi Aurelio Uncini

In this paper a blind source separation algorithm in convolutive environment is presented. In order to avoid the classical permutation ambiguity in the frequency domain solution, a geometrical constraint is considered. Moreover a beamformer algorithm is integrated with the proposed solution: in this way the directivity pattern of the proposed architecture can take into account the residual perm...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید