Sciweavers

5658 search results - page 27 / 1132
» An Efficient Counting Network
Sort
View
CPAIOR
2008
Springer
13 years 11 months ago
Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting
We consider the problem of estimating the model count (number of solutions) of Boolean formulas, and present two techniques that compute estimates of these counts, as well as eith...
Lukas Kroc, Ashish Sabharwal, Bart Selman
AAAI
2008
14 years 6 days ago
Lifted Probabilistic Inference with Counting Formulas
Lifted inference algorithms exploit repeated structure in probabilistic models to answer queries efficiently. Previous work such as de Salvo Braz et al.'s first-order variabl...
Brian Milch, Luke S. Zettlemoyer, Kristian Kerstin...
EUROPAR
2009
Springer
14 years 4 months ago
PSINS: An Open Source Event Tracer and Execution Simulator for MPI Applications
The size of supercomputers in numbers of processors is growing exponentially. Today’s largest supercomputers have upwards of a hundred thousand processors and tomorrow’s may ha...
Mustafa M. Tikir, Michael Laurenzano, Laura Carrin...
ICDE
2002
IEEE
106views Database» more  ICDE 2002»
14 years 11 months ago
OSSM: A Segmentation Approach to Optimize Frequency Counting
Computing the frequency of a pattern is one of the key operations in data mining algorithms. We describe a simple yet powerful way of speeding up any form of frequency counting sa...
Carson Kai-Sang Leung, Raymond T. Ng, Heikki Manni...
ICDE
2000
IEEE
96views Database» more  ICDE 2000»
14 years 11 months ago
Dynamic Miss-Counting Algorithms: Finding Implication and Similarity Rules with Confidence Pruning
Dynamic Miss-Countingalgorithms are proposed, which find all implication and similarity rules with confidence pruning but without support pruning. To handle data sets with a large...
Shinji Fujiwara, Jeffrey D. Ullman, Rajeev Motwani