Sciweavers

11345 search results - page 1618 / 2269
» Foundations of Computer Science
Sort
View
FOCS
2008
IEEE
16 years 1 months ago
Near-Optimal Sparse Recovery in the L1 Norm
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
Piotr Indyk, Milan Ruzic
FOCS
2008
IEEE
16 years 1 months ago
Kakeya Sets, New Mergers and Old Extractors
A merger is a probabilistic procedure which extracts the randomness out of any (arbitrarily correlated) set of random variables, as long as one of them is uniform. Our main result...
Zeev Dvir, Avi Wigderson
FOCS
2007
IEEE
16 years 1 months ago
Cryptography from Sunspots: How to Use an Imperfect Reference String
The Common Reference String (CRS) model equips all protocol participants with a common string that is sampled from a pre-specified distribution, say the uniform distribution. Thi...
Ran Canetti, Rafael Pass, Abhi Shelat
IMSCCS
2007
IEEE
16 years 1 months ago
Asymmetric Bagging and Feature Selection for Activities Prediction of Drug Molecules
Background: Activities of drug molecules can be predicted by QSAR (quantitative structure activity relationship) models, which overcomes the disadvantages of high cost and long cy...
Guo-Zheng Li, Hao-Hua Meng, Mary Qu Yang, Jack Y. ...
IMSCCS
2007
IEEE
16 years 1 months ago
Evolutionary Conservation of DNA-Contact residues in DNA-binding Domains
Background: DNA-binding proteins are of utmost importance to gene regulation. The identification of DNA-binding domains is useful for understanding the regulation mechanisms of DN...
Yao-Lin Chang, Huai-Kuang Tsai, Cheng-Yan Kao, Yun...
« Prev « First page 1618 / 2269 Last » Next »