Sciweavers

5138 search results - page 340 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
AAAI
2008
15 years 9 months 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...
SODA
2008
ACM
144views Algorithms» more  SODA 2008»
15 years 8 months ago
Fast dimension reduction using Rademacher series on dual BCH codes
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
Nir Ailon, Edo Liberty
AI
2006
Springer
15 years 6 months ago
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
Ole J. Mengshoel, David C. Wilkins, Dan Roth
CVPR
2008
IEEE
16 years 8 months ago
A quasi-random sampling approach to image retrieval
In this paper, we present a novel approach to contentsbased image retrieval. The method hinges in the use of quasi-random sampling to retrieve those images in a database which are...
Jun Zhou, Antonio Robles-Kelly
ICDE
2006
IEEE
144views Database» more  ICDE 2006»
16 years 8 months ago
Materialized Sample Views for Database Approximation
We consider the problem of creating a sample view of a database table. A sample view is an indexed, materialized view that permits efficient sampling from an arbitrary range query...
Shantanu Joshi, Chris Jermaine