Sciweavers

1573 search results - page 122 / 315
» A Data Structure for Sponsored Search
Sort
View
SC
2005
ACM
14 years 2 months ago
A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadthï¬...
Andy Yoo, Edmond Chow, Keith W. Henderson, Will Mc...
WISE
2002
Springer
14 years 2 months ago
Log Mining to Improve the Performance of Site Search
Despite of the popularity of global search engines, people still suffer from low accuracy of site search. The primary reason lies in the difference of link structures and data sca...
Gui-Rong Xue, Hua-Jun Zeng, Zheng Chen, Wei-Ying M...
SBBD
2007
165views Database» more  SBBD 2007»
13 years 10 months ago
Peer-to-Peer Information Search
We consider the network structure and query processing capabilities of social communities like bookmarks and photo sharing communities such as del.icio.us or flickr. A common fea...
Sebastian Michel, Josiane Xavier Parreira
CN
2007
108views more  CN 2007»
13 years 9 months ago
On the peninsula phenomenon in web graph and its implications on web search
Web masters usually place certain web pages such as home pages and index pages in front of others. Under such a design, it is necessary to go through some pages to reach the desti...
Tao Meng, Hong-Fei Yan
ISCA
2008
IEEE
136views Hardware» more  ISCA 2008»
13 years 9 months ago
A Randomized Queueless Algorithm for Breadth-First Search
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
K. Subramani, Kamesh Madduri