2252 search results - page 250 / 451 » Improving Random Forests |
114
click to vote
SACRYPT
2005
Springer
15 years 9 months ago
2005
Springer
In this paper we study the substitution-permutation network (SPN) on which AES is based. We introduce AES∗ , a SPN identical to AES except that fixed S-boxes are replaced by ran...
109
Voted
STACS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We consider variations of two well-known centrality measures, betweenness and closeness, with a different model of information spread. Rather than along shortest paths o...
116
Voted
ASIACRYPT
2004
Springer
15 years 9 months ago
2004
Springer
We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Di...
141
Voted
ISOLA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. This paper presents a formal analysis of the device discovery phase of the Bluetooth wireless communication protocol. The performance of this process is the result of a c...
148
Voted
PPSN
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps con...