Sciweavers

863 search results - page 85 / 173
» Links in edge-colored graphs
Sort
View
SIGIR
2006
ACM
14 years 2 months ago
Respect my authority!: HITS without hyperlinks, utilizing cluster-based language models
We present an approach to improving the precision of an initial document ranking wherein we utilize cluster information within a graph-based framework. The main idea is to perform...
Oren Kurland, Lillian Lee
ICDCS
2005
IEEE
14 years 2 months ago
Using a Layered Markov Model for Distributed Web Ranking Computation
The link structure of the Web graph is used in algorithms such as Kleinberg’s HITS and Google’s PageRank to assign authoritative weights to Web pages and thus rank them. Both ...
Jie Wu, Karl Aberer
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
14 years 2 months ago
A graph-theoretic approach to extract storylines from search results
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
Ravi Kumar, Uma Mahadevan, D. Sivakumar
AVI
2008
13 years 10 months ago
Visualizing program similarity in the Ac plagiarism detection system
Programming assignments are easy to plagiarize in such a way as to foil casual reading by graders. Graders can resort to automatic plagiarism detection systems, which can generate...
Manuel Freire
CCECE
2009
IEEE
14 years 7 days ago
Prohibitive-link Detection and Routing Protocol
In this paper we investigate the limits of routing according to left- or righthand rule (LHR). Using LHR, a node upon receipt of a message will forward to the neighbour that sits ...
Marwan Fayed, Hussein T. Mouftah