4212 search results - page 697 / 843 » On Compressible Pairings and Their Computation |
177
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
Automata on infinite words (ω-automata) have wide applications in formal language theory as well as in modeling and verifying reactive systems. Complementation of ωautomata is ...
159
click to vote
AIIA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The huge volume of gene expression data produced by microarrays and other high-throughput techniques has encouraged the development of new computational techniques to eva...
166
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
161
click to vote
COCOON
2009
Springer
16 years 1 months ago
2009
Springer
A graph class is sandwich monotone if, for every pair of its graphs G1 = (V, E1) and G2 = (V, E2) with E1 ⊂ E2, there is an ordering e1, . . . , ek of the edges in E2 \ E1 such ...
191
click to vote
ICUIMC
2009
ACM
16 years 1 months ago
2009
ACM
This paper presents a detailed review of remote user authentication schemes with smart cards based on bilinear pairings. The first scheme regarding this was proposed by Manik et a...