Sciweavers

4 search results - page 1 / 1
» Fast and Exact Top-k Search for Random Walk with Restart
Sort
View
CORR
2012
Springer
272views Education» more  CORR 2012»
12 years 7 days ago
Fast and Exact Top-k Search for Random Walk with Restart
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...
Yasuhiro Fujiwara, Makoto Nakatsuji, Makoto Onizuk...
ICDM
2008
IEEE
168views Data Mining» more  ICDM 2008»
13 years 11 months ago
Measuring Proximity on Graphs with Side Information
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...
Hanghang Tong, Huiming Qu, Hani Jamjoom
EDBT
2009
ACM
208views Database» more  EDBT 2009»
13 years 11 months ago
Flexible and efficient querying and ranking on hyperlinked data sources
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...
Ramakrishna Varadarajan, Vagelis Hristidis, Louiqa...
CORR
2012
Springer
229views Education» more  CORR 2012»
12 years 7 days ago
Cops and Invisible Robbers: the Cost of Drunkenness
We examine a version of the Cops and Robber (CR) game in which the robber is invisible, i.e., the cops do not know his location until they capture him. Apparently this game (CiR) h...
Athanasios Kehagias, Dieter Mitsche, Pawel Pralat