A boolean approach for detection of frequent items

Dan A. Simovici; Roman Sizov; Selim N. Mimaroglu

doi:10.1109/SYNASC.2017.00037

A boolean approach for detection of frequent items

Dan A. Simovici
, Roman Sizov
, Selim N. Mimaroglu

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Original language	English
Title of host publication	Proceedings - 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017
Editors	Tetsuo Ida, Tudor Jebelean, Dana Petcu, Stephen M. Watt, Viorel Negru, Daniela Zaharie
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	173-179
Number of pages	7
ISBN (Electronic)	9781538626269
DOIs	https://doi.org/10.1109/SYNASC.2017.00037
State	Published - Nov 9 2018
Event	19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017 - Timisoara, Romania Duration: Sep 21 2017 → Sep 24 2017

Publication series

Name	Proceedings - 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017

Conference

Conference	19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017
Country/Territory	Romania
City	Timisoara
Period	9/21/17 → 9/24/17

ASJC Scopus Subject Areas

Computational Mathematics
Computational Theory and Mathematics
Software

Keywords

Boolean functions
Minterms
Petersen graph
Support

Access to Document

10.1109/SYNASC.2017.00037

Cite this

Simovici, D. A., Sizov, R., & Mimaroglu, S. N. (2018). A boolean approach for detection of frequent items. In T. Ida, T. Jebelean, D. Petcu, S. M. Watt, V. Negru, & D. Zaharie (Eds.), Proceedings - 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017 (pp. 173-179). Article 8531283 (Proceedings - 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/SYNASC.2017.00037

A boolean approach for detection of frequent items. / Simovici, Dan A.; Sizov, Roman; Mimaroglu, Selim N.
Proceedings - 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017. ed. / Tetsuo Ida; Tudor Jebelean; Dana Petcu; Stephen M. Watt; Viorel Negru; Daniela Zaharie. Institute of Electrical and Electronics Engineers Inc., 2018. p. 173-179 8531283 (Proceedings - 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Simovici, DA, Sizov, R & Mimaroglu, SN 2018, A boolean approach for detection of frequent items. in T Ida, T Jebelean, D Petcu, SM Watt, V Negru & D Zaharie (eds), Proceedings - 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017., 8531283, Proceedings - 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017, Institute of Electrical and Electronics Engineers Inc., pp. 173-179, 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017, Timisoara, Romania, 9/21/17. https://doi.org/10.1109/SYNASC.2017.00037

Simovici DA, Sizov R, Mimaroglu SN. A boolean approach for detection of frequent items. In Ida T, Jebelean T, Petcu D, Watt SM, Negru V, Zaharie D, editors, Proceedings - 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017. Institute of Electrical and Electronics Engineers Inc. 2018. p. 173-179. 8531283. (Proceedings - 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017). doi: 10.1109/SYNASC.2017.00037

Simovici, Dan A. ; Sizov, Roman ; Mimaroglu, Selim N. / A boolean approach for detection of frequent items. Proceedings - 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017. editor / Tetsuo Ida ; Tudor Jebelean ; Dana Petcu ; Stephen M. Watt ; Viorel Negru ; Daniela Zaharie. Institute of Electrical and Electronics Engineers Inc., 2018. pp. 173-179 (Proceedings - 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017).

@inproceedings{34af8b0ed40842e7bef9b2867e3fcbbc,

title = "A boolean approach for detection of frequent items",

keywords = "Boolean functions, Minterms, Petersen graph, Support",

author = "Simovici, \{Dan A.\} and Roman Sizov and Mimaroglu, \{Selim N.\}",

note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017 ; Conference date: 21-09-2017 Through 24-09-2017",

year = "2018",

month = nov,

day = "9",

doi = "10.1109/SYNASC.2017.00037",

language = "English",

series = "Proceedings - 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "173--179",

editor = "Tetsuo Ida and Tudor Jebelean and Dana Petcu and Watt, \{Stephen M.\} and Viorel Negru and Daniela Zaharie",

booktitle = "Proceedings - 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017",

}

TY - GEN

T1 - A boolean approach for detection of frequent items

AU - Simovici, Dan A.

AU - Sizov, Roman

AU - Mimaroglu, Selim N.

PY - 2018/11/9

Y1 - 2018/11/9

KW - Boolean functions

KW - Minterms

KW - Petersen graph

KW - Support

UR - https://www.scopus.com/pages/publications/85058304210

UR - https://www.scopus.com/pages/publications/85058304210#tab=citedBy

U2 - 10.1109/SYNASC.2017.00037

DO - 10.1109/SYNASC.2017.00037

M3 - Conference contribution

AN - SCOPUS:85058304210

T3 - Proceedings - 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017

SP - 173

EP - 179

BT - Proceedings - 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017

A2 - Ida, Tetsuo

A2 - Jebelean, Tudor

A2 - Petcu, Dana

A2 - Watt, Stephen M.

A2 - Negru, Viorel

A2 - Zaharie, Daniela

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017

Y2 - 21 September 2017 through 24 September 2017

ER -

A boolean approach for detection of frequent items

Publication series

Conference

ASJC Scopus Subject Areas

Keywords

Access to Document

Other files and links

Fingerprint

Cite this