3401 search results - page 547 / 681 » Searching the workplace web |
155
click to vote
CSC
2008
15 years 7 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...
164
click to vote
CORR
2010
Springer
15 years 5 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...
171
click to vote
PERCOM
2008
ACM
15 years 5 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...
128
click to vote
SIGIR
2008
ACM
15 years 5 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...
165
click to vote
COMCOM
2002
15 years 5 months ago
2002
To implement adaptive replication strategies for Web documents, we have developed a wide area resource management system. This system allows servers to be managed on a local and g...