Results 301 to 310 of about 3,822,513 (334)

Sparse coding and rough set theory-based hybrid approach to the classificatory decomposition of cortical evoked potentials

open access: closedProceedings of the 9th International Conference on Neural Information Processing, 2002. ICONIP '02., 2002
This paper presents a novel approach to classification of decomposed cortical evoked potentials (EPs). The decomposition is based on learning of a sparse set of basis functions using an artificial neural network (ANN). The basis functions are generated according to a probabilistic model of the data.
Tomasz G. Smolinski   +3 more
openaire   +3 more sources

New Malicious Code Detection Based on N-Gram Analysis and Rough Set Theory

open access: closed, 2007
Motivated by the standard signature-based technique for detecting viruses, we explore the idea of automatically detecting malicious code using the N-gram analysis. The method is based on statistical learning and not strictly dependent on certain viruses. We propose the use of rough set theory (RST) to reduce the feature dimension.
Boyun Zhang   +4 more
openaire   +3 more sources

Classification of the odd sets in $$\hbox {PG}(4,4)$$ PG ( 4 , 4 ) and its application to coding theory

open access: closedApplicable Algebra in Engineering, Communication and Computing, 2013
A set $${\fancyscript{K}}$$ in $$\hbox {PG}(r,4), r \ge 2$$ ,
Taichiro Tanaka, Tatsuya Maruta
openaire   +2 more sources

Attribute Coding for the Rough Set Theory Based Rule Simplications by Using the Particle Swarm Optimization Algorithm

open access: closed, 2011
The attribute coding approach has been used in the Rough Set Theory (RST) based classification problems. The attribute coding defined ranges of the attribute values as multi-thresholds. If attribute values can be defined as appropriate values, the appropriate number of rules will be generated.
Jieh-Ren Chang   +3 more
openaire   +3 more sources

New Malicious Code Detection Based on N-gram Analysis and Rough Set Theory

open access: closed2006 International Conference on Computational Intelligence and Security, 2006
Boyun Zhang   +5 more
openaire   +3 more sources

On the Nonemptiness of Classes in Axiomatic Set Theory

, 1978
Theorems are proved on the consistency with , for , of each of the following three propositions: (1) there exists an L-minimal (in particular, nonconstructive) such that and , but every of class with constructive code is itself constructive; (2) there ...
V. Kanovei
semanticscholar   +1 more source

Channel coding with multilevel/phase signals

IEEE Transactions on Information Theory, 1982
A coding technique is described which improves error performance of synchronous data links without sacrificing data rate or requiring more bandwidth.
G. Ungerboeck
semanticscholar   +1 more source

Code Construction for Pliable Index Coding

International Symposium on Information Theory, 2019
A new variant of index coding problem termed as Pliable Index Coding Problem (PICOD) is formulated in [S. Brahma, C. Fragouli, "Pliable index coding", IEEE Transactions on Information Theory, vol. 61, no. 11, pp. 6192-6203, 2015]. In PICOD, we consider a
Shanuja Sasi, B. Rajan
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy