Results 31 to 40 of about 1,721,028 (327)

Pengelompokan Komentar Netizen pada Media Sosial Pemerintah Daerah Berdasarkan Frekuensi Kata Kunci

open access: yesKhazanah Informatika, 2018
Menurut survei internetworldstats yang dirilis pada Januari 2018, jumlah pengguna internet di Indonesia telah mencapai 132,7 juta jiwa. Dari jumlah tersebut, 40% di antaranya merupakan pengguna aktif media sosial.
Nur Aini Rakhmawati, Nody Risky Pratomo
doaj   +1 more source

Cybersecurity Named Entity Recognition Using Multi-Modal Ensemble Learning

open access: yesIEEE Access, 2020
Cybersecurity named entity recognition is an important part of threat information extraction from large-scale unstructured text collection in many cybersecurity applications.
Feng Yi, Bo Jiang, Lu Wang, Jianjun Wu
doaj   +1 more source

Simultaneous Finite Automata: An Efficient Data-Parallel Model for Regular Expression Matching [PDF]

open access: yes, 2013
Automata play important roles in wide area of computing and the growth of multicores calls for their efficient parallel implementation. Though it is known in theory that we can perform the computation of a finite automaton in parallel by simulating ...
862   +5 more
core   +2 more sources

Which Regular Expression Patterns are Hard to Match?

open access: yes, 2016
Regular expressions constitute a fundamental notion in formal language theory and are frequently used in computer science to define search patterns. A classic algorithm for these problems constructs and simulates a non-deterministic finite automaton ...
Backurs, Arturs, Indyk, Piotr
core   +1 more source

TECHNOLOGIES OF CREATING SPELL CHECKER 

open access: yesÌнформаційні технології в освіті, 2019
Spell checkers are created to control and correct mistakes in a user document. They are based on the comparison of every word against the spelling dictionary and on the use of correct spelling detection algorithms.
O. Riezina, R. Kosiuh , V. Vynnychenko
doaj   +1 more source

A Computational Interpretation of Context-Free Expressions

open access: yes, 2017
We phrase parsing with context-free expressions as a type inhabitation problem where values are parse trees and types are context-free expressions. We first show how containment among context-free and regular expressions can be reduced to a reachability ...
A Frisch   +8 more
core   +1 more source

On the symbol error probability of regular polytopes [PDF]

open access: yes, 2010
An exact expression for the symbol error probability of the four-dimensional 24-cell in Gaussian noise is derived. Corresponding expressions for other regular convex polytopes are summarized.
Agrell, Erik, Karlsson, Magnus
core   +2 more sources

States constrain-based algorithm for large scale regular expression matching

open access: yesTongxin xuebao, 2013
By analysis of state explosion in deterministic finite automata DFA,a novel algorithm Group2-DFA based on state constrains was proposed to reduce the memory usage.With the state constrains,states in NFA were classified into several groups.Group2-DFA ...
Wei HE, Yun-fei GUO, Hong-chao HU
doaj   +2 more sources

Mining DNA Sequence Patterns with Constraints Using Hybridization of Firefly and Group Search Optimization

open access: yesJournal of Intelligent Systems, 2018
DNA sequence mining is essential in the study of the structure and function of the DNA sequence. A few exploration works have been published in the literature concerning sequence mining in information mining task.
Lakshmanna Kuruva, Khare Neelu
doaj   +1 more source

Games for Succinctness of Regular Expressions [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2021
We present a version of so called formula size games for regular expressions. These games characterize the equivalence of languages up to expressions of a given size. We use the regular expression size game to give a simple proof of a known non-elementary succinctness gap between first-order logic and regular expressions.
openaire   +5 more sources

Home - About - Disclaimer - Privacy