In a localized routing algorithm, node A currently holding the message forwards it based on the location of itself, its neighboring nodes and destination. We propose to use depth ...
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
Abstract—In this paper, we present our results on the performance of MAC protocols in multi-hop wireless ad hoc networks in terms of the newly proposed metric “aggregate multi-...
Mariam Kaynia, Pedro H. J. Nardell, Paulo Cardieri...
In this paper, we propose to use 3D information to augment the Markov random field (MRF) model for object recognition. Conventional MRF for image-based object recognition usually ...
Wei Yu, Ahmed Bilal Ashraf, Yao-Jen Chang, Congcon...
This paper is aimed at evaluating the semantic information content of multiscale, low-level image segmentation. As a method of doing this, we use selected features of segmentation...