Sciweavers

906 search results - page 53 / 182
» Matching Subsequences in Trees
Sort
View
ICMCS
2010
IEEE
210views Multimedia» more  ICMCS 2010»
13 years 8 months ago
Confidence evaluation for robust, fast-converging disparity map refinement
To improve upon the initial disparity estimates stemming from a local correspondence method, a subsequent refinement step is commonly employed. The performance of the stereo match...
Jorn Jachalsky, Markus Schlosser, Dirk Gandolph
ACL
2008
13 years 9 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
ICDE
2010
IEEE
263views Database» more  ICDE 2010»
14 years 7 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
13 years 11 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...
ICDE
2007
IEEE
183views Database» more  ICDE 2007»
14 years 9 months ago
SpADe: On Shape-based Pattern Detection in Streaming Time Series
Monitoring predefined patterns in streaming time series is useful to applications such as trend-related analysis, sensor networks and video surveillance. Most current studies on s...
Yueguo Chen, Mario A. Nascimento, Beng Chin Ooi, A...