1937 search results - page 355 / 388 » Conditioning Probabilistic Databases |
CP
2000
Springer
15 years 2 months ago
2000
Springer
plexity Theorems: Talk Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 David McAllester Regular Papers Automatic Generation of Propagation Rules for F...
WACC
1999
ACM
15 years 2 months ago
1999
ACM
Knowledge discovery in databases (KDD) is an increasingly widespread activity. KDD processes may entail the use of a large number of data manipulation and analysis techniques, and...
104
click to vote
RECOMB
1998
Springer
15 years 2 months ago
1998
Springer
Given a strong match between regions of two sequences, how far can the match be meaningfully extended if gaps are allowed in the resulting alignment? The aim is to avoid searching...
RTSS
1990
IEEE
15 years 2 months ago
1990
IEEE
In a recent study, we have shown that in real-time database systems that discard late transactions, optimistic concurrency control outperforms locking. Although the optimistic alg...
KDD
2010
ACM
15 years 1 months ago
2010
ACM
We study the problem of finding the k most frequent items in a stream of items for the recently proposed max-frequency measure. Based on the properties of an item, the maxfrequen...