485 search results - page 46 / 97 » Iterative Bounding LAO |
103
Voted
NIPS
2004
15 years 2 months ago
2004
Existing algorithms for discrete partially observable Markov decision processes can at best solve problems of a few thousand states due to two important sources of intractability:...
108
Voted
NIPS
2001
15 years 2 months ago
2001
We present an algorithm that induces a class of models with thin junction trees--models that are characterized by an upper bound on the size of the maximal cliques of their triang...
118
click to vote
CAI
2007
Springer
15 years 18 days ago
2007
Springer
Abstract. The security of iterated hash functions relies on the properties of underlying compression functions. We study highly efficient compression functions based on block ciphe...
105
Voted
ADT
2005
15 years 15 days ago
2005
Coding for channels with synchronization errors is studied. Marker codes, each consisting of a low-density parity-check code with inserted markers, are developed. At low insertion...
DAM
2002
15 years 12 days ago
2002
Directed hypergraphs are used to model networks whose nodes are connected by directed buses. We study in this paper two parameters related to the fault-tolerance of directed bus n...