136 search results - page 14 / 28 » Greedy Regular Expression Matching |
89
Voted
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
This paper addresses a key bottleneck in the use of the 3D medial axis (MA) representation, namely, how the complex MA structure can be regularized so that similar, within-categor...
62
Voted
SIGECOM
2004
ACM
15 years 3 months ago
2004
ACM
When donating money to a (say, charitable) cause, it is possible to use the contemplated donation as negotiating material to induce other parties interested in the charity to dona...
CPM
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The efficiency of regular expression matching algorithms depends very much on the size of the nondeterministic finite automata (NFA) obtained from regular expressions. R...
TREC
2004
14 years 11 months ago
2004
This paper describes the participation of the School of Informatics, University of Wales, Bangor in the 2004 Text Retrieval Conference. We present additions and modications to the...
113
click to vote
PODS
2010
ACM
15 years 2 months ago
2010
ACM
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...