A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: ent...
Traditional mobile ad hoc routing protocols fail to deliver any data in Intermittently Connected Mobile Ad Hoc Networks (ICMN's) because of the absence of complete end-to-end ...
Distributed hash table (DHT) networks based on consistent hashing functions have an inherent load balancing problem. The problem becomes more severe due to the heterogeneity of ne...
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...