974 search results - page 115 / 195 » pairing 2010 |
STACS
2010
Springer
14 years 5 months ago
2010
Springer
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
EUROCRYPT
2010
Springer
14 years 3 months ago
2010
Springer
In this paper, we present two fully secure functional encryption schemes. Our first result is a fully secure attribute-based encryption (ABE) scheme. Previous constructions of AB...
GECCO
2010
Springer
14 years 3 months ago
2010
Springer
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
CONCUR
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Graph games of infinite length provide a natural model for open reactive systems: one player (Eve) represents the controller and the other player (Adam) represents the en...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...