Sciweavers

1451 search results - page 138 / 291
» Order independence and rationalizability
Sort
View
IJON
1998
172views more  IJON 1998»
15 years 6 months ago
Blind separation of convolved mixtures in the frequency domain
In this paper we employ information theoretic algorithms, previously used for separating instantaneous mixtures of sources, for separating convolved mixtures in the frequency doma...
Paris Smaragdis
JCB
2002
116views more  JCB 2002»
15 years 6 months ago
A Novel Approach to Remote Homology Detection: Jumping Alignments
We describe a new algorithm for protein classi cation and the detection of remote homologs. The rationale is to exploit both vertical and horizontal information of a multiple alig...
Rainer Spang, Marc Rehmsmeier, Jens Stoye
CPC
1999
105views more  CPC 1999»
15 years 6 months ago
Total Path Length For Random Recursive Trees
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
Robert P. Dobrow, James Allen Fill
MST
2002
128views more  MST 2002»
15 years 6 months ago
A Simple and Efficient Parallel Disk Mergesort
External sorting--the process of sorting a file that is too large to fit into the computer's internal memory and must be stored externally on disks--is a fundamental subroutin...
Rakesh D. Barve, Jeffrey Scott Vitter
NN
1998
Springer
15 years 6 months ago
Recruitment of reticulospinal neurones and steady locomotion in lamprey
In lamprey, the supraspinal control of velocity is mainly accomplished by the reticulospinal (RS) system. During locomotion, RS neurones are rhythmically active with a cycle durat...
Thierry Wannier, Walter Senn