Sciweavers

3172 search results - page 141 / 635
» New developments of the Z-EDM algorithm
Sort
View
WEA
2007
Springer
125views Algorithms» more  WEA 2007»
15 years 10 months ago
Simple Compression Code Supporting Random Access and Fast String Matching
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
Kimmo Fredriksson, Fedor Nikitin
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 1 months ago
The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection
Abstract. Hidden Markov models are traditionally decoded by the Viterbi algorithm which finds the highest probability state path in the model. In recent years, several limitations ...
Michal Nánási, Tomás Vinar, B...
DAC
1997
ACM
15 years 8 months ago
Safe BDD Minimization Using Don't Cares
In many computer-aided design tools, binary decision diagrams (BDDs) are used to represent Boolean functions. To increase the efficiency and capability of these tools, many algor...
Youpyo Hong, Peter A. Beerel, Jerry R. Burch, Kenn...
ISAAC
1995
Springer
135views Algorithms» more  ISAAC 1995»
15 years 7 months ago
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
Lars Arge
NIPS
2003
15 years 5 months ago
Applying Metric-Trees to Belief-Point POMDPs
Recent developments in grid-based and point-based approximation algorithms for POMDPs have greatly improved the tractability of POMDP planning. These approaches operate on sets of...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun