Sciweavers

1169 search results - page 129 / 234
» Comparing performance of algorithms for generating concept l...
Sort
View
INTERSPEECH
2010
13 years 3 months ago
A factorial sparse coder model for single channel source separation
We propose a probabilistic factorial sparse coder model for single channel source separation in the magnitude spectrogram domain. The mixture spectrogram is assumed to be the sum ...
Robert Peharz, Michael Stark, Franz Pernkopf, Yann...
ICASSP
2011
IEEE
13 years 20 days ago
Automatic identification of speaker role and agreement/disagreement in broadcast conversation
We present supervised approaches for detecting speaker roles and agreement/disagreement between speakers in broadcast conversation shows in three languages: English, Arabic, and M...
Wen Wang, Sibel Yaman, Kristin Precoda, Colleen Ri...
JSC
2011
99views more  JSC 2011»
12 years 11 months ago
Sparse polynomial division using a heap
In 1974, Johnson showed how to multiply and divide sparse polynomials using a binary heap. This paper introduces a new algorithm that uses a heap to divide with the same complexit...
Michael B. Monagan, Roman Pearce
BMCBI
2008
145views more  BMCBI 2008»
13 years 9 months ago
The contrasting properties of conservation and correlated phylogeny in protein functional residue prediction
Background: Amino acids responsible for structure, core function or specificity may be inferred from multiple protein sequence alignments where a limited set of residue types are ...
Jonathan R. Manning, Emily R. Jefferson, Geoffrey ...
CODES
2004
IEEE
14 years 20 days ago
Operation tables for scheduling in the presence of incomplete bypassing
Register bypassing is a powerful and widely used feature in modern processors to eliminate certain data hazards. Although complete bypassing is ideal for performance, bypassing ha...
Aviral Shrivastava, Eugene Earlie, Nikil D. Dutt, ...