Fast deterministic parsers for transition networks
Sign Up to like & getrecommendations! Published in 2017 at "Acta Informatica"
DOI: 10.1007/s00236-017-0308-3
Abstract: Extended BNF grammars (EBNF) allow regular expressions in the right parts of their rules. They are widely used to define languages, and can be represented by recursive Transition Networks (TN) consisting of a set of… read more here.
Keywords: shift; transition networks; parsers transition; deterministic parsers ... See more keywords
A Fast and Deterministic Algorithm for Consensus Set Maximization
Sign Up to like & getrecommendations! Published in 2018 at "IEEE Access"
DOI: 10.1109/access.2018.2835302
Abstract: With the current booming applications of virtual reality, augmented reality, and robotics, efficiently extracting the maximum consensus set among large-scale corrupted data has become a critical challenge. However, existing methods typically focus on optimization and… read more here.
Keywords: consensus set; consensus; fast deterministic; deterministic algorithm ... See more keywords