Sciweavers

98 search results - page 3 / 20
» Efficient Inference Control for Open Relational Queries
Sort
View
AAAI
2000
13 years 9 months ago
Semantics and Inference for Recursive Probability Models
In recent years, there have been several proposals that extend the expressive power of Bayesian networks with that of relational models. These languages open the possibility for t...
Avi Pfeffer, Daphne Koller
BMCBI
2010
135views more  BMCBI 2010»
13 years 7 months ago
GIGA: a simple, efficient algorithm for gene tree inference in the genomic age
Background: Phylogenetic relationships between genes are not only of theoretical interest: they enable us to learn about human genes through the experimental work on their relativ...
Paul D. Thomas
SIGMOD
2004
ACM
160views Database» more  SIGMOD 2004»
14 years 7 months ago
Extending Query Rewriting Techniques for Fine-Grained Access Control
Current day database applications, with large numbers of users, require fine-grained access control mechanisms, at the level of individual tuples, not just entire relations/views,...
Shariq Rizvi, Alberto O. Mendelzon, S. Sudarshan, ...
MST
2010
86views more  MST 2010»
13 years 2 months ago
Fixed-Parameter Enumerability of Cluster Editing and Related Problems
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
Peter Damaschke
DASFAA
2010
IEEE
176views Database» more  DASFAA 2010»
13 years 7 months ago
Efficient Database-Driven Evaluation of Security Clearance for Federated Access Control of Dynamic XML Documents
Achieving data security over cooperating web services is becoming a reality, but existing XML access control architectures do not consider this federated service computing. In this...
Erwin Leonardi, Sourav S. Bhowmick, Mizuho Iwaihar...