Sciweavers

342 search results - page 25 / 69
» Using Decision Trees to Construct a Practical Parser
Sort
View
ISAAC
1993
Springer
149views Algorithms» more  ISAAC 1993»
13 years 11 months ago
The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima
ICMLA
2007
13 years 9 months ago
Machine learned regression for abductive DNA sequencing
We construct machine learned regressors to predict the behaviour of DNA sequencing data from the fluorescent labelled Sanger method. These predictions are used to assess hypothes...
David Thornley, Maxim Zverev, Stavros Petridis
ICDAR
2009
IEEE
13 years 5 months ago
Syntactic Detection and Correction of Misrecognitions in Mathematical OCR
This paper proposes a syntactic method for detection and correction of misrecognized mathematical formulae for a practical mathematical OCR system. Linear monadic context-free tre...
Akio Fujiyoshi, Masakazu Suzuki, Seiichi Uchida
CAV
2008
Springer
125views Hardware» more  CAV 2008»
13 years 9 months ago
A Practical Approach to Word Level Model Checking of Industrial Netlists
In this paper we present a word-level model checking method that attempts to speed up safety property checking of industrial netlists. Our aim is to construct an algorithm that all...
Per Bjesse
EMNLP
2009
13 years 5 months ago
Improving Dependency Parsing with Subtrees from Auto-Parsed Data
This paper presents a simple and effective approach to improve dependency parsing by using subtrees from auto-parsed data. First, we use a baseline parser to parse large-scale una...
Wenliang Chen, Jun'ichi Kazama, Kiyotaka Uchimoto,...