4212 search results - page 43 / 843 » On Compressible Pairings and Their Computation |
DCC
2001
IEEE
16 years 3 days 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...
77
Voted
FLOPS
2004
Springer
15 years 6 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...
73
Voted
LATINCRYPT
2010
14 years 11 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...
EMNLP
2009
14 years 10 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...
123
Voted
NAR
2011
14 years 3 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...