136 search results - page 18 / 28 » Greedy Regular Expression Matching |
ESWS
2009
Springer
15 years 4 months ago
2009
Springer
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...
DM
2010
14 years 9 months ago
2010
Let m be a positive integer and let G be a graph. We consider the question: can the edge set E(G) of G be expressed as the union of a set M of matchings of G each of which has siz...
83
Voted
SIGCOMM
2010
ACM
14 years 9 months ago
2010
ACM
Accuracy and speed are the two most important metrics for Network Intrusion Detection/Prevention Systems (NIDS/NIPSes). Due to emerging polymorphic attacks and the fact that in ma...
69
Voted
IC3
2009
14 years 7 months ago
2009
A number of algorithms and approaches have been proposed towards the problem of scanning and digitizing research papers. We can classify work done in the past into three major appr...
SEMWEB
2010
Springer
14 years 7 months ago
2010
Springer
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...