Sciweavers

1109 search results - page 154 / 222
» Crawling on web graphs
Sort
View
PDP
2006
IEEE
15 years 10 months ago
Parallel Adaptive Technique for Computing PageRank
Re-ranking the search results using PageRank is a well-known technique used in modern search engines. Running an iterative algorithm like PageRank on a large web graph consumes bo...
Arnon Rungsawang, Bundit Manaskasemsak
ICPADS
2005
IEEE
15 years 10 months ago
An Efficient Partition-Based Parallel PageRank Algorithm
PageRank becomes the most well-known re-ranking technique of the search results. By its iterative computational nature, the computation takes much computing time and resource. Res...
Bundit Manaskasemsak, Arnon Rungsawang
192
Voted
EDBT
2011
ACM
254views Database» more  EDBT 2011»
14 years 8 months ago
SocialSearch: enhancing entity search with social network matching
This paper introduces the problem of matching people names to their corresponding social network identities such as their Twitter accounts. Existing tools for this purpose build u...
Gae-won You, Seung-won Hwang, Zaiqing Nie, Ji-Rong...
WEA
2005
Springer
176views Algorithms» more  WEA 2005»
15 years 10 months ago
High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
David A. Bader
BMCBI
2006
184views more  BMCBI 2006»
15 years 4 months ago
PathSys: integrating molecular interaction graphs for systems biology
Background: The goal of information integration in systems biology is to combine information from a number of databases and data sets, which are obtained from both high and low th...
Michael Baitaluk, Xufei Qian, Shubhada Godbole, Al...