474 search results - page 54 / 95 » On Multicast Path Finding Algorithms |
JCST
2007
13 years 7 months ago
2007
In this paper, we present a fast attack algorithm to find two-block collision of hash function MD5. The algorithm is based on the two-block collision differential path of MD5 that ...
JMLR
2010
13 years 2 months ago
2010
For a given target node T and a given depth k 1, we propose an algorithm for discovering a local causal network around the target T to depth k. In our algorithm, we find parents,...
HPDC
2005
IEEE
14 years 1 months ago
2005
IEEE
good data partitioning scheme is the need of the time. However it is very diflcult to arrive at a good solution as the number of possible dutupartitionsfor a given real lifeprogra...
DATAMINE
2000
13 years 7 months ago
2000
Abstract: Spatial data mining algorithms heavily depend on the efficient processing of neighborhood relations since the neighbors of many objects have to be investigated in a singl...
MOBIHOC
2004
ACM
14 years 7 months ago
2004
ACM
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...