arXiv (All)
open access
The Complexity of Computing Class Probabilities in BID Probabilistic Databases
We study the problem of computing class probabilities in block-independent disjoint (BID) probabilistic databases. Given the probability with which each block in the database realizes each feasible tuple type, the goal is to compute the probability of a class of worlds specified by a given tuple mul
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Random bipartite graphs with i.i.d. weights and applications to inhomogeneous random intersection graphs#1130446
- Prices, Bids, Values: One ML-Powered Combinatorial Auction to Rule Them All#149199
- Programmable Probabilistic Computer with 1,000,000 p-bits#306994
- Noisy Quantum Query Complexity via Fractional Block Sensitivity#1155441
- Colored Interaction-Profile Realization: Complexity of Matching-Match on Spiders#1083584
Record · ID 1035211
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive