Sciweavers

329 search results - page 7 / 66
» Probably Approximately Correct Learning
Sort
View
DEXAW
1999
IEEE
168views Database» more  DEXAW 1999»
13 years 11 months ago
Using the Distance Distribution for Approximate Similarity Queries in High-Dimensional Metric Spaces
We investigate the problem of approximate similarity (nearest neighbor) search in high-dimensional metric spaces, and describe how the distance distribution of the query object ca...
Paolo Ciaccia, Marco Patella
FLAIRS
2003
13 years 8 months ago
Sample Complexity of Real-Coded Evolutionary Algorithms
Researchers studying Evolutionary Algorithms and their applications have always been confronted with the sample complexity problem. The relationship between population size and gl...
Jian Zhang 0007, Xiaohui Yuan, Bill P. Buckles
STOC
1994
ACM
128views Algorithms» more  STOC 1994»
13 years 11 months ago
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, ...
ICASSP
2011
IEEE
12 years 11 months ago
Bias analysis of the forced choice detection test for Rayleigh/Rician statistics
For Rayleigh/Rician statistics at the decision device, the probability of correct decision in the forced choice (FC) hypothesis test is given in terms of a closed-form finite ser...
Graham W. Pulford
BMCBI
2010
124views more  BMCBI 2010»
13 years 7 months ago
Estimation and efficient computation of the true probability of recurrence of short linear protein sequence motifs in unrelated
Background: Large datasets of protein interactions provide a rich resource for the discovery of Short Linear Motifs (SLiMs) that recur in unrelated proteins. However, existing met...
Norman E. Davey, Richard J. Edwards, Denis C. Shie...