In an increasingly multilingual world, it is critical that information management tools organically support the simultaneous use of multiple natural languages. A pre-requisite for ...
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
In a Web database that dynamically provides information in response to user queries, two distinct schemas, interface schema (the schema users can query) and result schema (the sch...
Jiying Wang, Ji-Rong Wen, Frederick H. Lochovsky, ...
Matching and searching computations play an important role in the indexing of data. These computations are typically encoded in very tight loops with a single index variable and a...
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...