Sciweavers

898 search results - page 14 / 180
» An Analysis of Permutations in Arrays
Sort
View
92
Voted
DM
2008
104views more  DM 2008»
14 years 11 months ago
On edge-weighted recursive trees and inversions in random permutations
We introduce random recursive trees, where deterministically weights are attached to the edges according to the labeling of the trees. We will give a bijection between recursive t...
Markus Kuba, Alois Panholzer
RECOMB
2000
Springer
15 years 3 months ago
Universal DNA tag systems: a combinatorial design scheme
Custom-designed DNA arrays offer the possibility of simultaneously monitoring thousands of hybridization reactions. These arrays show great potential for many medical and scientif...
Amir Ben-Dor, Richard M. Karp, Benno Schwikowski, ...
70
Voted
NJC
1998
86views more  NJC 1998»
14 years 11 months ago
Parametric Permutation Routing via Matchings
The problem of routing permutations on graphs via matchings is considered, and we present a general algorithm which can be parameterized by different heuristics. This leads to a ...
Peter Høyer, Kim S. Larsen
TASLP
2010
113views more  TASLP 2010»
14 years 6 months ago
Spherical Harmonic Analysis of Wavefields Using Multiple Circular Sensor Arrays
Spherical harmonic decomposition of wavefields is not only an active problem in acoustic signal processing but also a useful tool in a plethora of applications such as 3D beamform...
Thushara D. Abhayapala, Aastha Gupta
IPL
2007
100views more  IPL 2007»
14 years 11 months ago
Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility
We study the Kolmogorov complexity of a Binary Insertion Tree, and present a succinct encoding scheme for Binary Insertion Trees produced from incompressible permutations. Based o...
Brendan Lucier, Tao Jiang, Ming Li