1143 search results - page 75 / 229 » pairing 2007 |
COLT
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. In this paper the concept of asymptotic complexity of languages is introduced. This concept formalises the notion of learnability in a particular environment and generali...
EUROCRYPT
2007
Springer
14 years 4 months ago
2007
Springer
Among the three broad classes of Identity-Based Encryption schemes built from pairings, the exponent inversion paradigm tends to be the most efficient, but also the least extensibl...
GD
2007
Springer
14 years 4 months ago
2007
Springer
The odd crossing number of G is the smallest number of pairs of edges that cross an odd number of times in any drawing of G. We show that there always is a drawing realizing the o...
HM
2007
Springer
14 years 4 months ago
2007
Springer
For the NP-hard Optimum Communication Spanning Tree (OCST) problem a cost minimizing spanning tree has to be found, where the cost depends on the communication volume between each ...
ICADL
2007
Springer
14 years 4 months ago
2007
Springer
Digital libraries have untapped potential for supporting language teaching and learning. This paper describes a new scheme for automating topicspecific language learning using a sp...