Sciweavers

1425 search results - page 94 / 285
» Beyond Dependency Graphs
Sort
View
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 7 months ago
Decentralized Search with Random Costs
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...
Oskar Sandberg
CVPR
2009
IEEE
15 years 3 months ago
Understanding Videos, Constructing Plots - Learning a Visually Grounded Storyline Model from Annotated Videos
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...
WEBI
2007
Springer
14 years 2 months ago
Detection of Web Subsites: Concepts, Algorithms, and Evaluation Issues
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 ...
Eduarda Mendes Rodrigues, Natasa Milic-Frayling, B...
CIKM
2010
Springer
13 years 6 months ago
Challenges in personalized authority flow based ranking of social media
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...
AAAI
2008
13 years 10 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
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...
Mo Chen, Jianzhuang Liu, Xiaoou Tang