In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
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...
—Traviando is a trace analyzer and visualizer for simulation traces of discrete event dynamic systems. In this paper, we briefly outline recent extensions of Traviando towards a...
In our previous work (`An Algebraic Watchdog for Wireless Network Coding'), we proposed a new scheme in which nodes can detect malicious behaviors probabilistically, police th...
This paper presents a novel opinion mining research problem, which is called Contrastive Opinion Modeling (COM). Given any query topic and a set of text collections from multiple ...