440 search results - page 14 / 88 » Partial Matching by Structural Descriptors |
VLDB
1993
ACM
13 years 11 months ago
1993
ACM
There are many advantages to be gained by storing the lexicon of a full text database in main memory. In this paper we describe how to use a compressed inverted file index to sear...
SSPR
2004
Springer
14 years 25 days ago
2004
Springer
Concavity trees are structures for 2-D shape representation. In this paper, we present a new recursive method for concavity tree matching that returns the distance between two attr...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
The problem of measuring similarity between web pages arises in many important Web applications, such as search engines and Web directories. In this paper, we propose a novel neig...
SIGIR
2010
ACM
13 years 2 months ago
2010
ACM
With the ever-increasing growth of the Internet, numerous copies of documents become serious problem for search engine, opinion mining and many other web applications. Since parti...
STOC
2010
ACM
14 years 9 days ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...