4212 search results - page 56 / 843 » On Compressible Pairings and Their Computation |
75
Voted
IEICET
2008
15 years 17 days ago
2008
In this paper, we suggest that all pairings be in a group from an abstract angle. According to our results, we can define some new pairings with short Miller loops and hence speed ...
96
Voted
ATC
2007
Springer
15 years 6 months ago
2007
Springer
A proxy signature scheme allows an entity to delegate its signing capability to another entity (proxy) in such a way that the proxy can sign messages on behalf of the delegator. Pr...
131
click to vote
COMPSAC
2003
IEEE
15 years 5 months ago
2003
IEEE
In this paper, we propose an algorithm to construct the Ordered Binary Decision Diagram (OBDD) representing the cut function of a terminal-pair network. The algorithm recognizes i...
107
click to vote
SPIRE
2007
Springer
15 years 6 months ago
2007
Springer
Compressed graphs representation has become an attractive research topic because of its applications to the manipulation of huge Web graphs in main memory. By far the best current ...
99
Voted
DAC
1998
ACM
16 years 1 months ago
1998
ACM
Memory is one of the most restricted resources in many modern embedded systems. Code compression can provide substantial savings in terms of size. In a compressed code CPU, a cach...