Sciweavers

478 search results - page 40 / 96
» A simple expected running time analysis for randomized
Sort
View
ICMCS
2000
IEEE
112views Multimedia» more  ICMCS 2000»
14 years 27 days ago
Short-Time Kurtosis of Speech Signals with Application to Co-channel Speech Separation
Recent work into the separation of mixtures of speech signals has shown some success. One particular method is based on the assumption that scalar mixtures of speech signals have ...
Phillip L. De Leon
SODA
2008
ACM
144views Algorithms» more  SODA 2008»
13 years 10 months ago
Fast dimension reduction using Rademacher series on dual BCH codes
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
Nir Ailon, Edo Liberty
PODC
2009
ACM
14 years 9 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
WIOPT
2010
IEEE
13 years 6 months ago
Spatial queueing analysis for mobility in pico cell networks
In this work, we characterize the performance of pico cell networks in presence of moving users. We model various traffic types between base-stations and mobiles as different typ...
Sreenath Ramanath, Veeraruna Kavitha, Eitan Altman
BMCBI
2006
138views more  BMCBI 2006»
13 years 8 months ago
Approximation properties of haplotype tagging
Background: Single nucleotide polymorphisms (SNPs) are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns,...
Staal A. Vinterbo, Stephan Dreiseitl, Lucila Ohno-...