2409 search results - page 148 / 482 » On Extended Regular Expressions |
136
click to vote
ACL
1996
15 years 6 months ago
1996
We report on a method for compiling decision trees into weighted finite-state transducers. The key assumptions are that the tree predictions specify how to rewrite symbols from an...
114
click to vote
ENTCS
2006
15 years 4 months ago
2006
Context and sequence variables allow matching to explore term-trees both in depth and in breadth. It makes context sequence matching a suitable computational mechanism for a rule-...
167
click to vote
LATA
2010
Springer
15 years 8 months ago
2010
Springer
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...
167
click to vote
SIAMIS
2008
15 years 4 months ago
2008
We consider the restoration of piecewise constant images where the number of the regions and their values are not fixed in advance, with a good difference of piecewise constant val...
125
click to vote
ADBIS
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. The need for location-based services has motivated an important research effort in the efficient processing of location-dependent queries. Most of the existing approaches...