4212 search results - page 814 / 843 » On Compressible Pairings and Their Computation |
117
click to vote
SASN
2006
ACM
15 years 6 months ago
2006
ACM
Key predistribution in wireless sensor networks refers to the problem of distributing secret keys among sensors prior to deployment. Solutions appeared in the literature can be cl...
116
Voted
BIBE
2005
IEEE
15 years 6 months ago
2005
IEEE
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
133
Voted
ATAL
2005
Springer
15 years 6 months ago
2005
Springer
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
89
Voted
CRYPTO
2005
Springer
15 years 6 months ago
2005
Springer
The Full-Domain Hash (FDH) signature scheme [3] forms one the most basic usages of random oracles. It works with a family F of trapdoor permutations (TDP), where the signature of m...
115
Voted
GD
2005
Springer
15 years 6 months ago
2005
Springer
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...