4940 search results - page 45 / 988 » On the Complexity of Universal Programs |
MLQ
2007
15 years 1 months ago
2007
We compute here the Borel complexity of the relation of isometry between separable Banach spaces, using results of Gao, Kechris [1] and Mayer-Wolf [4]. We show that this relation ...
109
click to vote
CCS
2007
ACM
15 years 8 months ago
2007
ACM
Recently, a universally composable framework for RFID authentication protocols providing availability, anonymity, and authenticity was proposed. In this paper we extend that frame...
110
click to vote
CSCL
2007
15 years 1 months ago
2007
Traditionally, universities focus primarily on instructionist teaching. Such an understanding has been criticized from theoretical and practical points of view. We believe that so...
IJON
2008
15 years 1 months ago
2008
Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden nodes, IEEE Trans. Neural Networks 17(4) (2006) 879
106
click to vote
JSYML
2008
15 years 1 months ago
2008
In a previous paper with M. Dzamonja, class forcings were given which fixed the complexity (a universality covering number) for certain types of structures of size together with ...