2095 search results - page 20 / 419 » Improved pebbling bounds |
105
click to vote
IACR
2011
13 years 11 months ago
2011
Keccak is one of the five hash functions selected for the final round of the SHA-3 competition and its inner primitive is a permutation called Keccakf. In this paper, we find t...
WADS
2005
Springer
15 years 5 months ago
2005
Springer
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
104
click to vote
ICC
2000
IEEE
15 years 4 months ago
2000
IEEE
Abstract—Packet scheduling disciplines play an important role in providing Quality of Service (QoS) guarantees to applications traffic in high speed networks. Several scheduling...
111
click to vote
ECCC
2000
14 years 11 months ago
2000
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
DMTCS
2010
14 years 9 months ago
2010
We proved that every planar triangle-free graph with n vertices has a subset of vertices that induces a forest of size at least (71n + 72)/128. This improves the earlier work of S...