898 search results - page 59 / 180 » An Analysis of Permutations in Arrays |
186
click to vote
FCT
2001
Springer
15 years 10 months ago
2001
Springer
This paper presents the results of using sequential analysis to find increment sequences that minimize the average running time of Shellsort, for array sizes up to several thousan...
147
click to vote
IDA
2009
Springer
16 years 26 days ago
2009
Springer
We consider a method for solving the permutation problem in blind source separation (BSS) by the frequency-domain independent component analysis (FD-ICA) by using phase linearity o...
175
click to vote
ICPR
2008
IEEE
16 years 22 days ago
2008
IEEE
In this paper we use doubly stochastic matrices to establish a link between Birkhoff polytopes and heat kernels on graphs. Based on this analysis we construct a multi-dimensional ...
176
click to vote
DAC
1994
ACM
15 years 10 months ago
1994
ACM
-- In this paper we present a new method for Boolean matching of completely specified Boolean functions. The canonical Generalized Reed-Muller forms are used as a powerful analysis...
148
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. T...