Sciweavers

589 search results - page 38 / 118
» Matching Concavity Trees
Sort
View
DL
2000
Springer
146views Digital Library» more  DL 2000»
15 years 2 months ago
Document overlap detection system for distributed digital libraries
In this paper we introduce the MatchDetectReveal(MDR) system, which is capable of identifying overlapping and plagiarised documents. Each component of the system is briefly descri...
Krisztián Monostori, Arkady B. Zaslavsky, H...
CORR
2008
Springer
74views Education» more  CORR 2008»
14 years 9 months ago
Biased Range Trees
A data structure, called a biased range tree, is presented that preprocesses a set S of n points in R2 and a query distribution D for 2-sided orthogonal range counting queries. The...
Vida Dujmovic, John Howat, Pat Morin
ACL
2008
14 years 11 months ago
Correcting Misuse of Verb Forms
This paper proposes a method to correct English verb form errors made by non-native speakers. A basic approach is template matching on parse trees. The proposed method improves on...
John Lee, Stephanie Seneff
85
Voted
ICDE
2010
IEEE
263views Database» more  ICDE 2010»
15 years 9 months ago
Managing Uncertainty of XML Schema Matching
Abstract-- Despite of advances in machine learning technologies, a schema matching result between two database schemas (e.g., those derived from COMA++) is likely to be imprecise. ...
Reynold Cheng, Jian Gong, David W. Cheung
STACS
1992
Springer
15 years 1 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...