Sciweavers

Share
ATVA
2010
Springer
154views Hardware» more  ATVA 2010»
8 years 10 months ago
Lattice-Valued Binary Decision Diagrams
Abstract. This work introduces a new data structure, called Lattice-Valued Binary Decision Diagrams (or LVBDD for short), for the compact representation and manipulation of functio...
Gilles Geeraerts, Gabriel Kalyon, Tristan Le Gall,...
NIPS
1992
8 years 10 months ago
Non-Linear Dimensionality Reduction
A method for creating a non
David DeMers, Garrison W. Cottrell
NIPS
1994
8 years 10 months ago
Reinforcement Learning with Soft State Aggregation
It is widely accepted that the use of more compact representations than lookup tables is crucial to scaling reinforcement learning (RL) algorithms to real-world problems. Unfortun...
Satinder P. Singh, Tommi Jaakkola, Michael I. Jord...
IJCAI
1997
8 years 10 months ago
Probabilistic Partial Evaluation: Exploiting Rule Structure in Probabilistic Inference
Bayesian belief networks have grown to prominence because they provide compact representations of many domains, and there are algorithms to exploit this compactness. The next step...
David Poole
ICN
2007
Springer
9 years 3 months ago
Succinct Representation of Static Packet Forwarding Tables
We develop algorithms for the compact representation of the trie structures that are used for Internet packet forwarding. Our compact representations are experimentally compared w...
Wencheng Lu, Sartaj Sahni
ICML
2008
IEEE
9 years 10 months ago
Semi-supervised learning of compact document representations with deep networks
Finding good representations of text documents is crucial in information retrieval and classification systems. Today the most popular document representation is based on a vector ...
Marc'Aurelio Ranzato, Martin Szummer
books