A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Analyzing videos of human activities involves not only
recognizing actions (typically based on their appearances),
but also determining the story/plot of the video. The storyline...
Abhinav Gupta (University of Maryland), Praveen Sr...
Web sites are often organized into several regions, each dedicated to a specific topic or serving a particular function. From a user’s perspective, these regions typically form ...
As the social interaction of Internet users increases, so does the need to effectively rank social media. We study the challenges of personalized ranking of blog posts. Web search...
Hassan Sayyadi, John Edmonds, Vagelis Hristidis, L...
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...