Sciweavers

402 search results - page 29 / 81
» Complexity of Decision Problems for Simple Regular Expressio...
Sort
View
PODS
2007
ACM
196views Database» more  PODS 2007»
14 years 8 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
ICDT
2007
ACM
97views Database» more  ICDT 2007»
14 years 2 months ago
Combining Temporal Logics for Querying XML Documents
Close relationships between XML navigation and temporal logics have been discovered recently, in particular between logics LTL and CTL⋆ and XPath navigation, and between the µ-c...
Marcelo Arenas, Pablo Barceló, Leonid Libki...
AAAI
2006
13 years 10 months ago
Tractable Classes of Metric Temporal Problems with Domain Rules
In this paper, we will deal with some important kinds of metric temporal reasoning problems that arise in many real-life situations. In particular, events X0, X1 . . . XN are mode...
T. K. Satish Kumar
ATAL
2010
Springer
13 years 9 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein
BMCBI
2002
109views more  BMCBI 2002»
13 years 8 months ago
Kangaroo - A pattern-matching program for biological sequences
Background: Biologists are often interested in performing a simple database search to identify proteins or genes that contain a well-defined sequence pattern. Many databases do no...
Doron Betel, Christopher W. V. Hogue