Sciweavers

52 search results - page 3 / 11
» Reporting Exact and Approximate Regular Expression Matches
Sort
View
CPM
2008
Springer
143views Combinatorics» more  CPM 2008»
13 years 8 months ago
A Black Box for Online Approximate Pattern Matching
Abstract. We present a deterministic black box solution for online approximate matching. Given a pattern of length m and a streaming text of length n that arrives one character at ...
Raphaël Clifford, Klim Efremenko, Benny Porat...
ADC
2008
Springer
141views Database» more  ADC 2008»
14 years 18 days ago
Approximate Retrieval of XML Data with ApproXPath
Several XML query languages have been proposed that use XPath expressions to locate data. But XPath expressions might miss some data because of irregularities in the data and sche...
Lin Xu, Curtis E. Dyreson
ESWS
2009
Springer
14 years 25 days ago
Ranking Approximate Answers to Semantic Web Queries
We consider the problem of a user querying semistructured data such as RDF without knowing its structure. In these circumstances, it is helpful if the querying system can perform a...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
SEMWEB
2010
Springer
13 years 4 months ago
Combining Approximation and Relaxation in Semantic Web Path Queries
We develop query relaxation techniques for regular path queries and combine them with query approximation in order to support flexible querying of RDF data when the user lacks know...
Alexandra Poulovassilis, Peter T. Wood
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 6 months ago
Probabilistic regular graphs
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
Nathalie Bertrand, Christophe Morvan