3484 search results - page 562 / 697 » Adversarial Web Search |
144
click to vote
ACL
2007
15 years 6 months ago
2007
This paper presents an application of PageRank, a random-walk model originally devised for ranking Web search results, to ranking WordNet synsets in terms of how strongly they pos...
141
click to vote
CSC
2008
15 years 6 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
145
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Entity matching is an important and difficult step for integrating web data. To reduce the typically high execution time for matching we investigate how we can perform entity matc...
154
click to vote
PERCOM
2008
ACM
15 years 4 months ago
2008
ACM
Traditional web service discovery is strongly related to the use of service directories. Especially in the case of mobile web services, where both service requestors and providers...
113
click to vote
SIGIR
2008
ACM
15 years 4 months ago
2008
ACM
Traditional information retrieval models assume that users express their information needs via text queries (i.e., their "talk"). In this poster, we consider Web browsin...