Sciweavers

568 search results - page 95 / 114
» New bounds for the Cebysev functional
Sort
View
ALT
1999
Springer
13 years 12 months ago
PAC Learning with Nasty Noise
We introduce a new model for learning in the presence of noise, which we call the Nasty Noise model. This model generalizes previously considered models of learning with noise. Th...
Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz
JCB
2000
101views more  JCB 2000»
13 years 7 months ago
Evaluation Measures of Multiple Sequence Alignments
Multiple sequence alignments (MSAs) are frequently used in the study of families of protein sequences or DNA/RNA sequences. They are a fundamental tool for the understanding of th...
Gaston H. Gonnet, Chantal Korostensky, Steven A. B...
IANDC
2010
84views more  IANDC 2010»
13 years 6 months ago
Underapproximation for model-checking based on universal circuits
For two naturals m, n such that m < n, we show how to construct a circuit C with m inputs and n outputs, that has the following property: for some 0 ≤ k ≤ m, the circuit deï...
Arie Matsliah, Ofer Strichman
CRYPTO
2007
Springer
106views Cryptology» more  CRYPTO 2007»
13 years 11 months ago
Indistinguishability Amplification
system is the abstraction of the input-output behavior of any kind of discrete system, in particular cryptographic systems. Many aspects of cryptographic security analyses and pro...
Ueli M. Maurer, Krzysztof Pietrzak, Renato Renner
SIGIR
2008
ACM
13 years 7 months ago
Directly optimizing evaluation measures in learning to rank
One of the central issues in learning to rank for information retrieval is to develop algorithms that construct ranking models by directly optimizing evaluation measures used in i...
Jun Xu, Tie-Yan Liu, Min Lu, Hang Li, Wei-Ying Ma