10 search results - page 1 / 2 » Identifying redundant search engines in a very large scale m... |
WIDM
2006
ACM
13 years 10 months ago
2006
ACM
For a given set of search engines, a search engine is redundant if its searchable contents can be found from other search engines in this set. In this paper, we propose a method t...
ICSE
1995
IEEE-ACM
13 years 8 months ago
1995
IEEE-ACM
One important component of a software process is the organizational context in which the process is enacted. This component is often missing or incomplete in current process model...
CSC
2008
13 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...
CVPR
2007
IEEE
14 years 6 months ago
2007
IEEE
Automatic annotation is an elegant alternative to explicit recognition in images. In annotation, the image is matched with keyword models, and the most relevant keywords are assig...
CPM
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. The mathematical concept of document resemblance captures well the informal notion of syntactic similarity. The resemblance can be estimated using a fixed size “sketch...