18209 search results - page 130 / 3642 » Some Remarks on the Paper |
COLT
2000
Springer
14 years 2 months ago
2000
Springer
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...
ECAI
1994
Springer
14 years 2 months ago
1994
Springer
We describe a detailed experimental investigation of the phase transition for several different classes of randomly generated satisfiability problems. We observe a remarkable consi...
CSB
2004
IEEE
14 years 1 months ago
2004
IEEE
One of the most remarkable properties of enzyme-substrate binding is the high substrate specificity among homologous enzymes. Identification of regions in enzymes that play an imp...
CCS
2006
ACM
14 years 1 months ago
2006
ACM
We extend the definitional work of Dwork, Naor and Sahai from deniable authentication to deniable key-exchange protocols. We then use these definitions to prove the deniability fe...
NIPS
2007
13 years 11 months ago
2007
Under natural viewing conditions, human observers shift their gaze to allocate processing resources to subsets of the visual input. Many computational models try to predict such v...