We consider the problem of finding "backbones" in multihop wireless networks. The backbone provides end-toend connectivity, allowing non-backbone nodes to save energy sin...
Seungjoon Lee, Bobby Bhattacharjee, Aravind Sriniv...
‘ We take advantage of the hierarchical structure of the star graph network to obtain an efficient method for constructing node-disjoint paths between arbitrary pairs of nodes in...
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 ...
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
We propose a novel MRF-based model for deformable image matching (also known as registration). The deformation is described by a field of discrete variables, representing displace...