Sciweavers

661 search results - page 18 / 133
» Argument Reduction by Factoring
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
On single-channel noise reduction in the time domain
In this paper, we revisit the noise-reduction problem in the time domain and present a way to decompose the ltered speech into two uncorrelated (orthogonal) components: the desire...
Jingdong Chen, Jacob Benesty, Yiteng Huang, Tomas ...
CLUSTER
2003
IEEE
15 years 2 months ago
Application-Bypass Reduction for Large-Scale Clusters
Process skew is an important factor in the performance of parallel applications, especially in large-scale clusters. Reduction is a common collective operation which, by its natur...
Adam Wagner, Darius Buntinas, Dhabaleswar K. Panda...
TWC
2010
14 years 4 months ago
A PAPR Reduction Method Based on Artificial Bee Colony Algorithm for OFDM Signals
Abstract--One of the major drawbacks of orthogonal frequency division multiplexing (OFDM) signals is the high peak to average power ratio (PAPR) of the transmitted signal. Many PAP...
Yajun Wang, Wen Chen, Chintha Tellambura
STOC
2007
ACM
83views Algorithms» more  STOC 2007»
15 years 10 months ago
Lattices that admit logarithmic worst-case to average-case connection factors
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
Chris Peikert, Alon Rosen
FSTTCS
2009
Springer
15 years 2 months ago
Bounded Size Graph Clustering with Applications to Stream Processing
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
Rohit Khandekar, Kirsten Hildrum, Sujay Parekh, De...