1795 search results - page 6 / 359 » Search by strategy |
120
click to vote
ACISP
2007
Springer
15 years 8 months ago
2007
Springer
In this paper, we propose a new construction algorithm for finding differential paths of Round 1 of SHA-1 for use in the collision search attack. Generally, the differential path o...
130
click to vote
ISCAS
2005
IEEE
15 years 9 months ago
2005
IEEE
— A computation-aware motion estimation algorithm is proposed in this paper. Its goal is to find the best block matching results in a computation-limited and computation-variant...
156
click to vote
TSMC
2011
14 years 11 months ago
2011
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...
141
click to vote
INFOSCALE
2006
ACM
15 years 10 months ago
2006
ACM
— We consider the following situation for a given large-scale network: Starting from an initial node we move to its neighbor node and repeat that until reaching a target node. Ho...
133
click to vote
ESANN
2006
15 years 5 months ago
2006
Abstract. Feature Selection techniques usually follow some search strategy to select a suitable subset from a set of features. Most neural network growing algorithms perform a sear...