ATVA
2010
Springer
13 years 5 months ago
2010
Springer
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...
NIPS
1992
13 years 5 months ago
1992
A method for creating a non
NIPS
1994
13 years 5 months ago
1994
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...
IJCAI
1997
13 years 6 months ago
1997
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...
ICN
2007
Springer
13 years 10 months ago
2007
Springer
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...
ICML
2008
IEEE
14 years 5 months ago
2008
IEEE
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 ...