4212 search results - page 43 / 843 » On Compressible Pairings and Their Computation |
128
click to vote
DCC
2001
IEEE
16 years 5 months ago
2001
IEEE
We prove that elements of the Weierstrass gap set of a pair of points may be used to define a geometric Goppa code which has minimum distance greater than the usual lower bound. We...
126
click to vote
FLOPS
2004
Springer
15 years 11 months ago
2004
Springer
This paper presents a backward sharing analysis for logic programs. The analysis computes pre-conditions for a query that guarantee a given post-condition is satisfied after the q...
125
click to vote
LATINCRYPT
2010
15 years 4 months ago
2010
A common scenario in many pairing-based cryptographic protocols is that one argument in the pairing is fixed as a long term secret key or a constant parameter in the system. In th...
148
click to vote
EMNLP
2009
15 years 3 months ago
2009
In this paper, we propose a novel class of graphs, the tripartite directed acyclic graphs (tDAGs), to model first-order rule feature spaces for sentence pair classification. We in...
194
click to vote
NAR
2011
14 years 9 months ago
2011
KUPS (The University of Kansas Proteomics Service) provides high-quality protein–protein interaction (PPI) data for researchers developing and evaluating computational models fo...