1945 search results - page 12 / 389 » Speeding up Serpent |
PARA
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
PKDD
2007
Springer
14 years 1 months ago
2007
Springer
A relevance filter is proposed which removes features based on the mutual information between class labels and features. It is proven that both feature independence and class condi...
WAW
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...
ASIACRYPT
2001
Springer
13 years 12 months ago
2001
Springer
This paper describes several speedups and simplifications for XTR. The most important results are new XTR double and single exponentiation methods where the latter requires a chea...
INFOCOM
2000
IEEE
13 years 11 months ago
2000
IEEE
— We consider cell-based switch architectures, whose internal switching matrix does not provide enough speed to avoid input buffering. These architectures require a scheduling al...