Sciweavers

661 search results - page 67 / 133
» Argument Reduction by Factoring
Sort
View
ACMACE
2008
ACM
14 years 12 months ago
Dimensionality reduced HRTFs: a comparative study
Dimensionality reduction is a statistical tool commonly used to map high-dimensional data into lower a dimensionality. The transformed data is typically more suitable for regressi...
Bill Kapralos, Nathan Mekuz, Agnieszka Kopinska, S...
ICALP
2010
Springer
15 years 2 months ago
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
Venkatesan Guruswami, Rishi Saket
SPEECH
1998
69views more  SPEECH 1998»
14 years 9 months ago
Noisy speech enhancement using discrete cosine transform
This paper illustrates the advantages of using the Discrete Cosine Transform (DCT) as compared to the standard Discrete Fourier Transform (DFT) for the purpose of removing noise e...
Ing Yann Soon, Soo Ngee Koh, Chai Kiat Yeo
FOCS
2004
IEEE
15 years 1 months ago
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...
Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O...
CVPR
2007
IEEE
15 years 12 months ago
Recognizing Human Activities from Silhouettes: Motion Subspace and Factorial Discriminative Graphical Model
We describe a probabilistic framework for recognizing human activities in monocular video based on simple silhouette observations in this paper. The methodology combines kernel pr...
Liang Wang, David Suter