Results 31 to 40 of about 2,023 (88)
CORLEONE - Core Linguistic Entity Online Extraction [PDF]
This report presents CORLEONE (Core Linguistic Entity Online Extraction) - a pool of loosely coupled general-purpose basic lightweight linguistic processing resources, which can be independently used to identify core linguistic entities and their ...
PISKORSKI JAKUB
core
We propose a novel concise function representation for graphical models, a central theoretical framework that provides the basis for many reasoning tasks. We then show how we exploit our concise representation based on deterministic finite state automata
Bistaffa, Filippo
core
Extended simple precedence [PDF]
Thesis (Ph. D.)--Michigan State University. Department of Electrical Engineering and System Science, 1970Includes bibliographical references (pages 66 ...
Greenberg, Lewis Harvey, 1942-
core +2 more sources
Designing and computing bounds for non-deterministic state machines [PDF]
Normally non-deterministic state machines can be transformed into deterministic FSMs, but this does not work if we allow output on non-deterministic state transitions.
Alexandrov, Stepan
core
Modelling of a Gazetteer Look-up Component [PDF]
This paper compares two storage models for gazetteers, nameley the standard one based on numbered indexing automata associated with an auxiliary storage device against a pure finite-state model, the latter being superior in terms of space and time ...
Jakub Piskorski
core
PRIVATON - Privacy Preserving Automaton for Proof of Computations [PDF]
Amid the landscape of confidential computing, where security and privacy reign supreme, PRIVATON emerges as a pioneering and practical solution to safeguard sensitive data and computations. A verifiable proof of computation model, with one of its variant
Bala Subramanyan
core
Network Security plays an essential role in the modern world. Current network services mainly rely on processing of payload in packets. Deep Packet Inspection (DPI) is a key factor in examining the packet payload which uses the signatures to identify ...
S. Prithi, S. Sumathi
semanticscholar +1 more source
Mathematical linguistics [PDF]
but in fact this is still an early draft, version 0.56, August 1 2001.
Kornai, András
core +2 more sources
On the computation of Hilbert series and Poincare series for algebras with infinite Grobner bases [PDF]
In this paper we present algorithms to compute finite state automata which, given any rational language, recognize the languages of normal words and n-chains.
Jonas Mansson
core
Automata Approach to XML Data Indexing: Implementation and Experimental Evaluation [PDF]
Tato práce se zabývá implementací a experimentálním vyhodnocením metod pro indexování XML dokumentů. Konkrétně se jedná o metody Tree String Path Automaton (TSPA), Tree String Path Subsequence Automaton (TSPSA) a Tree Path Automaton (TPA).
Renc Lukáš
core

