Sciweavers

2661 search results - page 374 / 533
» Quantum Complexity Classes
Sort
View
ICALP
2009
Springer
16 years 3 months ago
When Are Timed Automata Determinizable?
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...
Christel Baier, Nathalie Bertrand, Patricia Bouyer...
222
Voted
SIGMOD
2008
ACM
136views Database» more  SIGMOD 2008»
16 years 3 months ago
Mining relationships among interval-based events for classification
Existing temporal pattern mining assumes that events do not have any duration. However, events in many real world applications have durations, and the relationships among these ev...
Dhaval Patel, Wynne Hsu, Mong-Li Lee
189
Voted
SIGMOD
2006
ACM
111views Database» more  SIGMOD 2006»
16 years 3 months ago
On the database/network interface in large-scale publish/subscribe systems
The work performed by a publish/subscribe system can conceptually be divided into subscription processing and notification dissemination. Traditionally, research in the database a...
Badrish Chandramouli, Jun Yang 0001, Junyi Xie
127
Voted
SIGMOD
2004
ACM
120views Database» more  SIGMOD 2004»
16 years 3 months ago
Prediction and Indexing of Moving Objects with Unknown Motion Patterns
Existing methods for prediction in spatio-temporal databases assume that objects move according to linear functions. This severely limits their applicability, since in practice mo...
Yufei Tao, Christos Faloutsos, Dimitris Papadias, ...
116
Voted
PODS
2001
ACM
85views Database» more  PODS 2001»
16 years 3 months ago
On XML Integrity Constraints in the Presence of DTDs
The paper investigates XML document speci cations with DTDs and integrity constraints, such as keysand foreign keys. We study the consistency problem of checking whether a given s...
Wenfei Fan, Leonid Libkin