Sciweavers

2434 search results - page 173 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
124
Voted
STACS
2009
Springer
15 years 10 months ago
A Comparison of Techniques for Sampling Web Pages
As the World Wide Web is growing rapidly, it is getting increasingly challenging to gather representative information about it. Instead of crawling the web exhaustively one has to...
Eda Baykan, Monika Rauch Henzinger, Stefan F. Kell...
AAAI
2008
15 years 6 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...
123
Voted
SODA
2008
ACM
144views Algorithms» more  SODA 2008»
15 years 5 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 4 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
WACV
2007
IEEE
15 years 10 months ago
Extraction of Person Silhouettes from Surveillance Imagery using MRFs
We present a method for the simultaneous detection and segmentation of objects from static images. We employ lowlevel contour features that enable us to learn the coarse object sh...
Vinay Sharma, James W. Davis