1466 search results - page 26 / 294 » Complexity of Reasoning over Temporal Data Models |
121
click to vote
OTM
2010
Springer
15 years 1 months ago
2010
Springer
In this paper we deal with problems occurring in evolving interrelated Web databanks. Examples of such databanks are networks of interlinked scientific repositories on the Web, man...
123
click to vote
LREC
2010
15 years 5 months ago
2010
This paper investigates the effectiveness of online temporal language model adaptation when applied to a Thai broadcast news transcription task. Our adaptation scheme works as fol...
166
click to vote
LICS
2012
IEEE
13 years 6 months ago
2012
IEEE
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...
149
Voted
EDBTW
2010
Springer
15 years 10 months ago
2010
Springer
There has been lately an increased activity of publishing structured data in RDF due to the activity of the Linked Data community1 . The presence on the Web of such a huge informa...
138
Voted
CONCUR
2010
Springer
15 years 4 months ago
2010
Springer
Higher dimensional automata (HDA) are a model of concurrency that can express most of the traditional partial order models like Mazurkiewicz traces, pomsets, event structures, or P...