2494 search results - page 284 / 499 » Dependable Distributed Computing Using Free Databases |
SIGMOD
2011
ACM
12 years 11 months ago
2011
ACM
Conventional OLTP systems assign each transaction to a worker thread and that thread accesses data, depending on what the transaction dictates. This thread-to-transaction work ass...
ICML
2009
IEEE
14 years 9 months ago
2009
IEEE
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...
UAI
2003
13 years 9 months ago
2003
Methods for learning Bayesian networks can discover dependency structure between observed variables. Although these methods are useful in many applications, they run into computat...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We propose two statistical tests to determine if two samples are from different distributions. Our test statistic is in both cases the distance between the means of the two sample...
ACISP
2001
Springer
14 years 25 days ago
2001
Springer
Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...