Sciweavers

1054 search results - page 36 / 211
» Guarded Expressions in Practice
Sort
View
WAE
2001
227views Algorithms» more  WAE 2001»
14 years 10 days ago
Compact DFA Representation for Fast Regular Expression Search
We present a new technique to encode a deterministic nite automaton (DFA). Based on the speci c properties of Glushkov's nondeterministic nite automaton (NFA) construction alg...
Gonzalo Navarro, Mathieu Raffinot
ICDE
2008
IEEE
153views Database» more  ICDE 2008»
15 years 9 days ago
Increasing the Expressivity of Conditional Functional Dependencies without Extra Complexity
The paper proposes an extension of CFDs [1], referred to as extended Conditional Functional Dependencies (eCFDs). In contrast to CFDs, eCFDs specify patterns of semantically relate...
Loreto Bravo, Wenfei Fan, Floris Geerts, Shuai Ma
WIKIS
2010
ACM
14 years 2 months ago
Deep hypertext with embedded revision control implemented in regular expressions
While text versioning was definitely a part of the original hypertext concept [21, 36, 44], it is rarely considered in this context today. Still, we know that revision control un...
Victor S. Grishchenko
FPL
2008
Springer
178views Hardware» more  FPL 2008»
14 years 15 days ago
High-speed regular expression matching engine using multi-character NFA
An approach is presented for high throughput matching of regular expressions (regexes) by first converting them into corresponding Non-deterministic Finite Automata (NFAs) which a...
Norio Yamagaki, Reetinder P. S. Sidhu, Satoshi Kam...
WLP
2005
Springer
14 years 4 months ago
Expressing Interaction in Combinatorial Auction through Social Integrity Constraints
Abstract. Combinatorial Auctions are an attractive application of intelligent agents; their applications are countless and are shown to provide good revenues. On the other hand, on...
Marco Alberti, Federico Chesani, Alessio Guerri, M...