Sciweavers

886 search results - page 108 / 178
» Learning Distance Functions using Equivalence Relations
Sort
View
EUROCRYPT
2010
Springer
14 years 2 months ago
Computational Soundness, Co-induction, and Encryption Cycles
We analyze the relation between induction, co-induction and the presence of encryption cycles in the context of computationally sound symbolic equivalence of cryptographic express...
Daniele Micciancio
LFP
1990
102views more  LFP 1990»
13 years 10 months ago
A Semantic Basis for Quest
Quest is a programming language based on impredicative type quantifiers and subtyping within a three-level structure of kinds, types and type operators, and values. The semantics ...
Luca Cardelli, Giuseppe Longo
APAL
2006
118views more  APAL 2006»
13 years 9 months ago
Final coalgebras and the Hennessy-Milner property
The existence of a final coalgebra is equivalent to the existence of a formal logic with a set (small class) of formulas that has the Hennessy-Milner property of distinguishing co...
Robert Goldblatt
ALT
2004
Springer
14 years 6 months ago
Complexity of Pattern Classes and Lipschitz Property
Rademacher and Gaussian complexities are successfully used in learning theory for measuring the capacity of the class of functions to be learned. One of the most important propert...
Amiran Ambroladze, John Shawe-Taylor
ALT
2003
Springer
14 years 1 months ago
Efficiently Learning the Metric with Side-Information
Abstract. A crucial problem in machine learning is to choose an appropriate representation of data, in a way that emphasizes the relations we are interested in. In many cases this ...
Tijl De Bie, Michinari Momma, Nello Cristianini