The following pages link to MayBMS (Q31890):
Displaying 11 items.
- A dichotomy in the complexity of counting database repairs (Q389240) (← links)
- Range queries on uncertain data (Q897858) (← links)
- Analyzing real-world SPARQL queries and ontology-based data access in the context of probabilistic data (Q1678449) (← links)
- The complexity of Bayesian networks specified by propositional and relational languages (Q1711881) (← links)
- Not all FPRASs are equal: demystifying FPRASs for DNF-counting (Q2009190) (← links)
- Query answering under probabilistic uncertainty in Datalog\(+/-\) ontologies (Q2248518) (← links)
- Consistency checking and querying in probabilistic databases under integrity constraints (Q2453564) (← links)
- A Probabilistic Interpretation for a Geometric Similarity Measure (Q3011988) (← links)
- (Q5094118) (← links)
- Transducing Markov sequences (Q5501935) (← links)
- Infinite Probabilistic Databases (Q5874370) (← links)