Sciweavers

447 search results - page 10 / 90
» Re-ranking search results using document-passage graphs
Sort
View
SIAMDM
2008
143views more  SIAMDM 2008»
13 years 6 months ago
Coloring Bull-Free Perfectly Contractile Graphs
We consider the class of graphs that contain no bull, no odd hole, and no antihole of length at least five. We present a new algorithm that colors optimally the vertices of every g...
Benjamin Lévêque, Frédé...
WWW
2010
ACM
14 years 1 months ago
Measurement-calibrated graph models for social network experiments
Access to realistic, complex graph datasets is critical to research on social networking systems and applications. Simulations on graph data provide critical evaluation of new sys...
Alessandra Sala, Lili Cao, Christo Wilson, Robert ...
SPIRE
2010
Springer
13 years 5 months ago
Querying the Web Graph - (Invited Talk)
This paper focuses on using hyperlinks in the ranking of web search results. We give a brief overview of the vast body of work in the area; we provide a quantitative comparison of ...
Marc Najork
LCN
2007
IEEE
14 years 1 months ago
Search Algorithms for Unstructured Peer-to-Peer Networks
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...
Reza Dorrigiv, Alejandro López-Ortiz, Pawel...
SIGIR
2011
ACM
12 years 9 months ago
Learning search tasks in queries and web pages via graph regularization
As the Internet grows explosively, search engines play a more and more important role for users in effectively accessing online information. Recently, it has been recognized that ...
Ming Ji, Jun Yan, Siyu Gu, Jiawei Han, Xiaofei He,...