Sciweavers

910 search results - page 87 / 182
» Detecting False Matches in String Matching Algorithms
Sort
View
IJCV
2006
116views more  IJCV 2006»
15 years 3 months ago
Contextual Inference in Contour-Based Stereo Correspondence
Standard approaches to stereo correspondence have difficulty when scene structure does not lie in or near the frontal parallel plane, in part because an orientation disparity as we...
Gang Li, Steven W. Zucker
IVC
2008
101views more  IVC 2008»
15 years 3 months ago
A system for processing handwritten bank checks automatically
In the US and many other countries, bank checks are preprinted with the account number and the check number in MICR ink and format; as such, these two numeric fields can be easily...
Rafael Palacios, Amar Gupta
SIGIR
1998
ACM
15 years 7 months ago
Fast Searching on Compressed Text Allowing Errors
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...
ACIIDS
2010
IEEE
172views Database» more  ACIIDS 2010»
15 years 8 months ago
Automatic Lexical Annotation Applied to the SCARLET Ontology Matcher
This paper proposes lexical annotation as an effective method to solve the ambiguity problems that affect ontology matchers. Lexical annotation associates to each ontology elemen...
Laura Po, Sonia Bergamaschi
ICANNGA
2009
Springer
201views Algorithms» more  ICANNGA 2009»
15 years 9 months ago
A Novel Signal-Based Approach to Anomaly Detection in IDS Systems
In this paper we present our original methodology, in which Matching Pursuit is used for networks anomaly and intrusion detection. The architecture of anomaly-based IDS based on si...
Lukasz Saganowski, Michal Choras, Rafal Renk, Wito...