Sciweavers

203 search results - page 36 / 41
» Exponentiable morphisms of domains
Sort
View
TASLP
2010
117views more  TASLP 2010»
13 years 2 months ago
Speech Enhancement Using Gaussian Scale Mixture Models
This paper presents a novel probabilistic approach to speech enhancement. Instead of a deterministic logarithmic relationship, we assume a probabilistic relationship between the fr...
Jiucang Hao, Te-Won Lee, Terrence J. Sejnowski
ICDE
2009
IEEE
290views Database» more  ICDE 2009»
14 years 9 months ago
GraphSig: A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases
Graphs are being increasingly used to model a wide range of scientific data. Such widespread usage of graphs has generated considerable interest in mining patterns from graph datab...
Sayan Ranu, Ambuj K. Singh
DAC
2007
ACM
14 years 8 months ago
Synthesizing Stochasticity in Biochemical Systems
Randomness is inherent to biochemistry: at each instant, the sequence of reactions that fires is a matter of chance. Some biological systems exploit such randomness, choosing betw...
Brian Fett, Jehoshua Bruck, Marc D. Riedel
SDM
2009
SIAM
149views Data Mining» more  SDM 2009»
14 years 4 months ago
Near-optimal Supervised Feature Selection among Frequent Subgraphs.
Graph classification is an increasingly important step in numerous application domains, such as function prediction of molecules and proteins, computerised scene analysis, and an...
Alexander J. Smola, Arthur Gretton, Hans-Peter Kri...
SC
2009
ACM
14 years 2 months ago
Autotuning multigrid with PetaBricks
Algorithmic choice is essential in any problem domain to realizing optimal computational performance. Multigrid is a prime example: not only is it possible to make choices at the ...
Cy P. Chan, Jason Ansel, Yee Lok Wong, Saman P. Am...