Sciweavers

5606 search results - page 550 / 1122
» Randomization Techniques for Graphs.
Sort
View
AAAI
2008
15 years 9 months ago
Exploiting Causal Independence Using Weighted Model Counting
Previous studies have demonstrated that encoding a Bayesian network into a SAT-CNF formula and then performing weighted model counting using a backtracking search algorithm can be...
Wei Li 0002, Pascal Poupart, Peter van Beek
ICDE
2009
IEEE
152views Database» more  ICDE 2009»
16 years 9 months ago
Tree Indexing on Flash Disks
Abstract-- Large flash disks have become an attractive alternative to magnetic hard disks, due to their high random read performance, low energy consumption and other features. How...
Yinan Li, Bingsheng He, Qiong Luo, Ke Yi
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
16 years 1 months ago
Lower Bounds on Quantum Multiparty Communication Complexity
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
Troy Lee, Gideon Schechtman, Adi Shraibman
SSDBM
2008
IEEE
131views Database» more  SSDBM 2008»
16 years 1 months ago
Linked Bernoulli Synopses: Sampling along Foreign Keys
Random sampling is a popular technique for providing fast approximate query answers, especially in data warehouse environments. Compared to other types of synopses, random sampling...
Rainer Gemulla, Philipp Rösch, Wolfgang Lehne...
TABLEAUX
1998
Springer
15 years 11 months ago
Simplification and Backjumping in Modal Tableau
This paper is concerned with various schemes for enhancing the performance of modal tableau procedures. It discusses techniques and strategies for dealing with the nondeterminism i...
Ullrich Hustadt, Renate A. Schmidt