Sciweavers

601 search results - page 7 / 121
» A New Path Computation Algorithm and Its Implementation in N...
Sort
View
ACISP
2007
Springer
13 years 11 months ago
A New Strategy for Finding a Differential Path of SHA-1
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...
Jun Yajima, Yu Sasaki, Yusuke Naito, Terutoshi Iwa...
IWANN
1997
Springer
13 years 11 months ago
Dynamic Path Planning with Spiking Neural Networks
: The path planning problem is relevant for all applications in which a mobil robot should autonomously navigate. Finding the shortest path in an environment that is only partialy ...
Ulrich Roth, Marc Walker, Arne Hilmann, Heinrich K...
CBMS
2008
IEEE
14 years 1 months ago
A New Path Length Measure Based on GO for Gene Similarity with Evaluation using SGD Pathways
We propose a new method for measuring the semantic similarity of genes based on path length between their annotation terms in the Gene Ontology. Our method applies an exponential ...
Anurag Nagar, Hisham Al-Mubaid
COMCOM
2007
136views more  COMCOM 2007»
13 years 7 months ago
Demand-scalable geographic multicasting in wireless sensor networks
In this paper, we focus on the challenge of demand-scalable multicast routing in wireless sensor networks. Due to the ad-hoc nature of the placement of the sensor nodes as well as...
Shibo Wu, K. Selçuk Candan
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
14 years 24 days ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang