Sciweavers

202 search results - page 13 / 41
» Counting Distance Permutations
Sort
View
ICPR
2006
IEEE
14 years 8 months ago
ICA-Based Clustering for Resolving Permutation Ambiguity in Frequency-Domain Convolutive Source Separation
Permutation ambiguity is an inherent limitation in independent component analysis, which is a bottleneck in frequency-domain methods of convolutive source separation. In this pape...
Minje Kim, Seungjin Choi
VTC
2006
IEEE
14 years 1 months ago
A Novel Hybrid ARQ Scheme Based on Shift Column Permutation Bit Interleaving for OFDM Systems
—In this paper, a novel hybrid ARQ scheme based on shift column permutation bit interleaving is proposed for OFDM systems. When a packet is requested for retransmission, we can u...
Junwoo Jung, Hyungwon Park, Jaesung Lim
IJAC
2007
89views more  IJAC 2007»
13 years 7 months ago
Bounding Right-Arm Rotation Distances
Abstract. Rotation distance quantifies the difference in shape between two rooted binary trees of the same size by counting the minimum number of elementary changes needed to tra...
Sean Cleary, Jennifer Taback
COMBINATORICS
2004
81views more  COMBINATORICS 2004»
13 years 7 months ago
A Card Shuffling Analysis of Deformations of the Plancherel Measure of the Symmetric Group
This paper finds and analyzes a formula for the total variation distance between iterations of riffle shuffles and iterations of "cut and then riffle shuffle". This allo...
Jason E. Fulman
AUTOMATICA
2008
116views more  AUTOMATICA 2008»
13 years 7 months ago
A dynamical systems approach to weighted graph matching
Graph matching is a fundamental problem that arises frequently in the areas of distributed control, computer vision, and facility allocation. In this paper, we consider the optimal...
Michael M. Zavlanos, George J. Pappas