Sciweavers

903 search results - page 46 / 181
» On the reduction of a random basis
Sort
View
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
16 years 2 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani
CIT
2006
Springer
15 years 5 months ago
A new collision resistant hash function based on optimum dimensionality reduction using Walsh-Hadamard transform
Hash functions play the most important role in various cryptologic applications, ranging from data integrity checking to digital signatures. Our goal is to introduce a new hash fu...
Barzan Mozafari, Mohammad Hasan Savoji
BMCBI
2007
94views more  BMCBI 2007»
15 years 2 months ago
False positive reduction in protein-protein interaction predictions using gene ontology annotations
Background: Many crucial cellular operations such as metabolism, signalling, and regulations are based on protein-protein interactions. However, the lack of robust protein-protein...
Mahmood A. Mahdavi, Yen-Han Lin
ICIP
1994
IEEE
16 years 3 months ago
Wavelet Soft-Thresholding of Time-Frequency Representations
The high noise sensitivity of the Wigner distribution makes smoothing a necessity for producing readable time-frequency images of noise corrupted signals. Since h e a r smoothing ...
Richard G. Baraniuk
FOCS
2008
IEEE
15 years 8 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...