Zobrazeno 1 - 10
of 146
pro vyhledávání: '"KOVÁCS, RÉKA"'
std::string view is a reference-like data structure in the C++ Standard Template Library (STL) that enables fast and cheap processing of read-only strings. Due to its wide applicability and performance enhancing power, std::string view has been very
Externí odkaz:
http://arxiv.org/abs/2408.09325
Static analysis is a method of analyzing source code without executing it. It is widely used to find bugs and code smells in industrial software. Besides other methods, the most important techniques are those based on the abstract syntax tree and tho
Externí odkaz:
http://arxiv.org/abs/2408.05657
Autor:
Horvath, Gabor, Kovacs, Reka, Szalay, Richard, Porkolab, Zoltan, Orban, Gyorgy, Krupp, Daniel
CodeChecker is an open source project that integrates different static analysis tools such as the Clang Static Analyzer and Clang-Tidy into the build systems, continuous integration loops, and development workflows of C++ programmers. It has a powerf
Externí odkaz:
http://arxiv.org/abs/2408.02220
Static analysis is the analysis of a program without executing it, usually carried out by an automated tool. Symbolic execution is a popular static analysis technique used both in program verification and in bug detection software. It works by interp
Externí odkaz:
http://arxiv.org/abs/2408.01909
Autor:
Kovacs, Reka Agnes
For a binary matrix X, the Boolean rank br(X) is the smallest integer k for which X equals the Boolean sum of k rank-1 binary matrices, and the isolation number i(X) is the maximum number of 1s no two of which are in a same row, column and a 2x2 subm
Externí odkaz:
http://arxiv.org/abs/2206.04089
Autor:
KOVÁCS, RÉKA1 reka.kovacs@econ.ubbcluj.ro, SOPON, DIANA ANNELIESE1 diana.sopon@econ.ubbcluj.ro
Publikováno v:
Philobiblon: Transylvanian Journal of Multidisciplinary Research in Humanities. 2024, Vol. 29 Issue 1, p173-190. 18p.
Autor:
Smith, Mathew B., Leow, Jun Min, Kovacs, Reka, Wong, Phui Yuen, Shalaby, Hisham, McKinley, John C.
Publikováno v:
In Foot and Ankle Surgery August 2024 30(6):520-523
Binary matrix factorisation is an essential tool for identifying discrete patterns in binary data. In this paper we consider the rank-k binary matrix factorisation problem (k-BMF) under Boolean arithmetic: we are given an n x m binary matrix X with p
Externí odkaz:
http://arxiv.org/abs/2106.13434
Publikováno v:
In The Journal of Foot and Ankle Surgery
Identifying discrete patterns in binary data is an important dimensionality reduction tool in machine learning and data mining. In this paper, we consider the problem of low-rank binary matrix factorisation (BMF) under Boolean arithmetic. Due to the
Externí odkaz:
http://arxiv.org/abs/2011.04457