101 search results - page 17 / 21 » When Are Timed Automata Determinizable |
113
Voted
CC
1999
Springer
15 years 7 months ago
1999
Springer
Tomita devised a method of generalized LR GLR parsing to parse ambiguous grammars e ciently. A GLR parser uses linear-time LR parsing techniques as long as possible, falling back...
125
Voted
SIGMOD
2003
ACM
16 years 3 months ago
2003
ACM
We consider the problem of evaluating large numbers of XPath filters, each with many predicates, on a stream of XML documents. The solution we propose is to lazily construct a sin...
122
Voted
IDEAS
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper we study the problem of deciding whether a regular path query over views in data-integration systems can be re-expressed without recursion. The problem becomes chall...
176
Voted
SOCO
2010
Springer
15 years 1 months ago
2010
Springer
This paper presents an evolutionary algorithm for modeling the arrival dates in time-stamped data sequences such as newscasts, e-mails, IRC conversations, scientific journal artic...
115
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge...