232 search results - page 32 / 47 » Termination of linear bounded term rewriting systems |
ICC
2008
IEEE
14 years 2 months ago
2008
IEEE
A common technique for wireless positioning is to estimate time-of-arrivals (TOAs) of signals traveling between a target node and a number of reference nodes, and then to determin...
IANDC
2011
13 years 2 months ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
PODS
2010
ACM
14 years 21 days ago
2010
ACM
Both semantic and type-based query optimization rely on the idea that queries often exhibit non-trivial rewritings if the state space of the database is restricted. Despite their ...
LDTA
2010
13 years 7 months ago
2010
Real programming languages are often defined using ambiguous context-free grammars. Some ambiguity is intentional while other ambiguity is accidental. A good grammar development e...
FPGA
2004
ACM
13 years 11 months ago
2004
ACM
Pattern matching for network security and intrusion detection demands exceptionally high performance. Much work has been done in this field, and yet there is still significant roo...