Sciweavers

499 search results - page 54 / 100
» A Search Algorithm for Clusters in a Network or Graph
Sort
View
CIKM
2010
Springer
13 years 6 months ago
A structured approach to query recommendation with social annotation data
Query recommendation has been recognized as an important mean to help users search and also improve the usability of search engines. Existing approaches mainly focus on helping us...
Jiafeng Guo, Xueqi Cheng, Gu Xu, Huawei Shen
WWW
2005
ACM
14 years 8 months ago
Disambiguating Web appearances of people in a social network
Say you are looking for information about a particular person. A search engine returns many pages for that person's name but which pages are about the person you care about, ...
Ron Bekkerman, Andrew McCallum
ASUNAM
2010
IEEE
13 years 9 months ago
Fast Discovery of Reliable Subnetworks
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
Petteri Hintsanen, Hannu Toivonen, Petteri Sevon
WWW
2006
ACM
14 years 8 months ago
Discovering event evolution graphs from newswires
In this paper, we propose an approach to automatically mine event evolution graphs from newswires on the Web. Event evolution graph is a directed graph in which the vertices and e...
Christopher C. Yang, Xiaodong Shi
ICC
2007
IEEE
14 years 2 months ago
Speed Up Queries in Unstructured Peer-to-Peer Networks
—Unstructured peer-to-peer networks have gained a lot of popularity due to their resilience to network dynamics. The core operation in such networks is to efficiently locate res...
Zhan Zhang, Yong Tang, Shigang Chen