3548 search results - page 576 / 710 » Searching the deep web |
PAKDD
2010
ACM
14 years 1 months ago
2010
ACM
We present a general framework for the task of extracting specific information “on demand” from a large corpus such as the Web under resource-constraints. Given a database wit...
IAT
2009
IEEE
14 years 1 months ago
2009
IEEE
—Information can change rapidly on the web. For example, news may hint some new story starts to develop. Many more news related to the original event begin to pour in the web. Im...
ACL
2007
13 years 11 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...
CSC
2008
13 years 11 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...
CORR
2010
Springer
13 years 10 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...