Sciweavers

367 search results - page 31 / 74
» CT-Rank: A Time-aware Ranking Algorithm for Web Search
Sort
View
WWW
2007
ACM
15 years 10 months ago
A kernel based structure matching for web services search
This paper describes a kernel based Web Services (abbreviated as service) matching mechanism for service discovery and integration. The matching mechanism tries to exploit the lat...
Yu Jianjun, Guo Shengmin, Su Hao, Zhang Hui, Xu Ke
CIKM
2001
Springer
15 years 2 months ago
Merging Techniques for Performing Data Fusion on the Web
Data fusion on the Web refers to the merging, into a unified single list, of the ranked document lists, which are retrieved in response to a user query by more than one Web search...
Theodora Tsikrika, Mounia Lalmas
WSDM
2009
ACM
104views Data Mining» more  WSDM 2009»
15 years 4 months ago
Top-k aggregation using intersections of ranked inputs
There has been considerable past work on efficiently computing top k objects by aggregating information from multiple ranked lists of these objects. An important instance of this...
Ravi Kumar, Kunal Punera, Torsten Suel, Sergei Vas...
85
Voted
SIGIR
2010
ACM
15 years 1 months ago
Freshness matters: in flowers, food, and web authority
The collective contributions of billions of users across the globe each day result in an ever-changing web. In verticals like news and real-time search, recency is an obvious sign...
Na Dai, Brian D. Davison
IUI
2003
ACM
15 years 2 months ago
Adapting to the user's internet search strategy on small devices
World Wide Web search engines typically return thousands of results to the users. To avoid users browsing through the whole list of results, search engines use ranking algorithms ...
Jean-David Ruvini