Back to Results
First PageMeta Content
Cryptographic hash functions / Computer programming / Information retrieval / Computational complexity theory / Universal hashing / Hash function / Lookup table / Hashing / Search algorithms / Computing


Low-Density Parity Constraints for Hashing-Based Discrete Integration
Add to Reading List

Document Date: 2014-02-16 19:30:21

Open Document

File Size: 383,84 KB

Share Result on Facebook

City

Beijing / Madras / Lisbon / Hashing / /

Company

IBM / Princeton University Press / SIAM Journal / Neural Information Processing Systems / BP / M. and Sinclair / Intel / /

Country

Jordan / Portugal / China / /

Facility

Cornell University / LibDAI library / /

IndustryTerm

randomized algorithm / integration algorithms / belief propagation algorithms / solver search tree / combinatorial reasoning tool / suboptimal decoding algorithms / computing / model counting applications / energy models / Approximation algorithms / pseudocode as Algorithm / /

Organization

Royal Statistical Society / African Union / National Science Foundation / American Mathematical Society / U.S.A. Ashish Sabharwal IBM Watson Research Center / Princeton University / Cornell University / /

Person

Carla P. Gomes / Spiegelhalter / A. Bart Selman / A. Ashish Sabharwal / /

Position

author / D. J. / B. Model / /

ProvinceOrState

New York / /

PublishedMedium

SIAM Journal on Computing / Journal of the Royal Statistical Society / Machine Learning / Theoretical Computer Science / the T times / /

RadioStation

1 When / /

Technology

WISH algorithm / M. Tree-reweighted belief propagation algorithms / integration algorithms / Approximation algorithms / machine learning / recent WISH algorithm / suboptimal decoding algorithms / 0.4 Algorithm / /

SocialTag