Sciweavers

784 search results - page 134 / 157
» Relaxing the Value Restriction
Sort
View
SPIRE
2010
Springer
13 years 7 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
CORR
2010
Springer
115views Education» more  CORR 2010»
13 years 7 months ago
Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements
This paper presents several novel theoretical results regarding the recovery of a low-rank matrix from just a few measurements consisting of linear combinations of the matrix entr...
Emmanuel J. Candès, Yaniv Plan
ACL
2010
13 years 7 months ago
Open Information Extraction Using Wikipedia
Information-extraction (IE) systems seek to distill semantic relations from naturallanguage text, but most systems use supervised learning of relation-specific examples and are th...
Fei Wu 0003, Daniel S. Weld
COGSR
2011
97views more  COGSR 2011»
13 years 4 months ago
Sleep loss and driver performance: Quantitative predictions with zero free parameters
Fatigue has been implicated in an alarming number of motor vehicle accidents, costing billions of dollars and thousands of lives. Unfortunately, the ability to predict performance...
Glenn Gunzelmann, L. Richard Moore, Dario D. Salvu...
JMLR
2010
124views more  JMLR 2010»
13 years 3 months ago
Consistent Nonparametric Tests of Independence
Three simple and explicit procedures for testing the independence of two multi-dimensional random variables are described. Two of the associated test statistics (L1, log-likelihoo...
Arthur Gretton, László Györfi