We study personalized web ranking algorithms based on the existence of document clusterings. Motivated by the topic sensitive page ranking of Haveliwala [19], we develop and imple...
We consider a random subgraph Gp of a host graph G formed by retaining each edge of G with probability p. We address the question of determining the critical value p (as a function...
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
Social network popularity continues to rise as they broaden out to more users. Hidden away within these social networks is a valuable set of data that outlines everyone’s relatio...
Thomas Tran, Kelcey Chan, Shaozhi Ye, Prantik Bhat...
Abstract. This paper is motivated by exploring the impact of the number of channels on the achievable communication latency for a specific communication task. We focus on how to u...
Peng-Jun Wan, Zhu Wang, Zhiyuan Wan, Scott C.-H. H...
Abstract. In this paper, we show through a simple secure symmetric key based protocol design and its implementation the feasibility of secure data collection in a vehicular sensor ...
Harry Gao, Seth Utecht, Fengyuan Xu, Haodong Wang,...
Abstract. In this paper we explore the usefulness of various types of publicationrelated metadata, such as citation networks and curated databases, for the task of identifying gene...
Abstract. Increasingly ubiquitous wireless technologies require novel localization techniques to pinpoint the position of an uncooperative node, whether the target be a malicious d...
This paper addresses the following optimization problem in a plane multihop wireless networks under the physical interference model: From a given a set of communication links whose...