default search action
24th SYNASC 2022: Hagenberg / Linz, Austria
- Bruno Buchberger, Mircea Marin, Viorel Negru, Daniela Zaharie:
24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2022, Hagenberg / Linz, Austria, September 12-15, 2022. IEEE 2022, ISBN 978-1-6654-6545-8 - Camelia Chira:
Complex Network Analysis using Artificial Intelligence Algorithms. 1-3 - Michael Affenzeller, Michael Bögl, Lukas Fischer, Florian Sobieczky, Kaifeng Yang, Jan Zenisek:
Prescriptive Analytics: When Data- and Simulation-based Models Interact in a Cooperative Way. 1-8 - Wolfgang Schreiner:
Implementation Techniques for Mathematical Model Checking. 12-15 - Martina Seidl:
What's New In QBF Solving? : (Invited Talk). 16-18 - Jan-Michael Holzinger, Róbert Vajda:
Extreme Points of the Unit Ball B4 in the Space of Real Polynomials of Degree at most Four with the Supremum Norm. 19-26 - Kisun Lee, Stephen Melczer, Josip Smolcic:
Homotopy Techniques for Analytic Combinatorics in Several Variables. 27-34 - Marc Moreno Maza, Haoze Yuan:
Balanced Dense Multivariate Multiplication: The General Case. 35-42 - Stephen M. Watt:
Detecting Implicit Indeterminates in Symbolic Computation. 43-50 - Gleb A. Koshevoy, Denis Mironov:
F-polynomials & Newton polytopes. 51-54 - James H. Davenport, Ali Kemal Uncu:
Artificial Conflict Sampling for Real Satisfiability Problems. 55-58 - Zoltán Kovács, Christopher W. Brown, Tomás Recio, Róbert Vajda:
A web version of Tarski, a system for computing with Tarski formulas and semialgebraic sets. 59-62 - Siyuan Deng, Zahra Mohammadi, Gregory J. Reid:
Algorithm for intersecting symbolic and approximate linear differential varieties. 63-70 - Irene Hiess, Ludwig Kampel, Michael Wagner, Dimitris E. Simos:
IPO-MAXSAT: The In-Parameter-Order Strategy combined with MaxSAT solving for Covering Array Generation. 71-79 - Vedad Hadzic, Roderick Bloem, Ankit Shukla, Martina Seidl:
FERPModels: A Certification Framework for Expansion-Based QBF Solving. 80-83 - Yannick Chevalier, Michaël Rusinowitch:
Deciding Whether two Codes Have the Same Ambiguities is in co-NP. 84-91 - Saber Gholami, Hovhannes A. Harutyunyan:
Fully-adaptive Model for Broadcasting with Universal Lists. 92-99 - Shashank K. Mehta, Mahesh Sreekumar Rajasree:
On the bases of Zn lattice. 100-107 - Cojocaru Dragos:
Proof of Useful Work Based on Matrix Computation. 108-116 - Eneia Nicolae Todoran:
Quantitative Programming and Markov Decision Processes. 117-124 - Mario Reja:
Empirical evaluation of LZW-Compressed Multiple Pattern Matching Algorithms. 125-132 - Gabriel-Razvan Busuioc, Andrei Paraschiv, Mihai Dascalu:
FB-RO-Offense - A Romanian Dataset and Baseline Models for Detecting Offensive Language in Facebook Comments. 133-142 - Theodor-Alexandru Vlad, Eugen Croitoru:
Accelerating heuristic convergence on the "Evolution of Mona Lisa" problem by including image-centric mutation operators. 143-149 - Adrian Groza, Áron Katona:
Fact-checking with explanations. 150-157 - Andreea-Nicoleta Dutulescu, Mihai Dascalu, Stefan Ruseti:
Unsupervised Extractive Summarization with BERT. 158-164 - Andrei Dugaesescu, Adina Magda Florea:
Evaluation of Class Activation Methods for Understanding Image Classification Tasks. 165-172 - Radu-Andrei Rosu, Mihaela Elena Breaban, Henri Luchian:
Exploring the potential of prototype-based soft-labels data distillation for imbalanced data classification. 173-180 - Madalina Dicu, Laura Diosan, Anca Andreica, Camelia Chira, Alin Cordos:
The Impact of Convolutional Neural Network Parameters in the Binary Classification of Mammograms. 181-188 - Darian M. Onchis, Codruta Istin, Eduard Hogea:
Advantages of a neuro-symbolic solution for monitoring IT infrastructures alerts. 189-194 - Marco Radovancovici, Darius Galis, Ciprian Pungila:
Using N-Gram Variations in Static Analysis for Malware Detection. 195-199 - Victor Bogdan, Alin Brîndusescu:
Authors and Collaborator Groups Ranking Analysis on SYNASC using Centrality Measures. 200-207 - Zoltán Tasnádi, Noémi Gaskó:
An Ant Colony Optimisation Approach to the Densest k-Subgraph Problem. 208-211 - Andrei Chis, Ana-Maria Ghiran, Robert Andrei Buchmann:
Proof of Concept for a Roundtrip Engineering IS for the New Enterprise in the Industry 4.0 Era. 212-215 - Vasile Ionut Iga, Gheorghe Cosmin Silaghi:
Building customized Named Entity Recognition models for specific process automation tasks. 216-219 - Florin Dumitrescu, Adina Magda Florea, Mihai Trascau, Alexandru Sorici:
Intelligent Agent for Food Recognition in a Smart Fridge. 220-225 - Md Nahin Islam, Doina Logofatu:
Machine Learning Models to Predict Soil Moisture for Irrigation Schedule. 226-232 - Guillermo Torres, Carles Sánchez, Debora Gil:
Learning networks hyper-parameter using multi-objective optimization of statistical performance metrics. 233-238 - Sorin Valcan, Mihail Gaianu:
Eye Detection For Drivers Using Convolutional Neural Networks With Automatically Generated Ground Truth Data. 239-244 - Bogdan Ilie Sighencea:
Pedestrian Trajectory Prediction Based on Tree Method using Graph Neural Networks. 245-249 - Bogdan Budihala, Todor Ivascu, Sebastian Stefaniga:
Motorage - Computer vision-based self-sufficient smart parking system. 250-257 - Cristina Laura Sîrbu, Georgiana Simion, Catalin-Daniel Caleanu:
Improving the Diagnostic of Contrast Enhanced Ultrasound Imaging using Optical Flow for Focal Liver Lesion Detection. 258-263 - Alexandru Ionascu, Sebastian Stefaniga:
Semi-Supervised Pipeline for Human Sprites Neural Rendering. 264-267 - Luka Jovanovic, Dijana Jovanovic, Milos Antonijevic, Miodrag Zivkovic, Nebojsa Budimirovic, Ivana Strumberger, Nebojsa Bacanin:
The XGBoost Tuning by Improved Firefly Algorithm for Network Intrusion Detection. 268-275 - Catalin Stoean, Nebojsa Bacanin, Ruxandra Stoean, Leonard Ionescu, Cristian Daniel Alecsa, Mircea Hotoleanu, Miguel A. Atencia Ruiz, Gonzalo Joya:
On Using Perceptual Loss within the U-Net Architecture for the Semantic Inpainting of Textile Artefacts with Traditional Motifs. 276-283 - Roxana Sipos-Lascu, Laura-Silvia Diosan:
An Evaluation of Image Texture Descriptors and their Invariant Properties. 284-292 - Paul Cousin, Aude Maignan:
Organic Structures Emerging From Bio-Inspired Graph-Rewriting Automata. 293-296 - Martin Steiger, Hans Georg Brachtendorf, Gabriel Kronberger:
Identification of Discrete Non-Linear Dynamics of a Radio-Frequency Power Amplifier Circuit using Symbolic Regression. 297-303 - Gabriel Kronberger:
Local Optimization Often is Ill-conditioned in Genetic Programming for Symbolic Regression. 304-310 - Wolfgang Roland, Michael Kommenda, Gerald R. Berger-Weber:
Application of Symbolic Regression in Polymer Processing. 311-318 - Fabrício Olivetti de França:
Comparison of OLS and NLS to fit Transformation-Interaction-Rational expressions. 319-322 - Fabrício Olivetti de França:
Symbolic Regression with augmented dataset using RuleFit. 323-326 - David Piringer, Bernhard Bloder, Gabriel Kronberger:
Steel Phase Kinetics Modeling using Symbolic Regression. 327-330 - Marco Radovancovici, Darius Galis, Ciprian Pungila:
A Practical Analysis of Techniques for Minting Genetic Information as NFTs in Blockchain Technology. 331-337 - Octavian-Florin Maghiar:
AlphaFold-based protein analysis pipeline. 338-341 - Ciprian-Mihai Ceausescu, Bogdan Alexe:
Cerebral Metastases Segmentation using Transfer Gliomas Learning and GrabCut. 342-346 - Marilena Lupascu:
Obfuscation Techniques Based on Random Strings Used in Malicious VBA Scripts. 347-352 - Ciprian-Alin Simion:
Reducing Adversarial Vulnerability Using GANs. 353-358 - George Popoiu:
One side class SVM training methods for malware detection. 359-364 - Anton Dan Gabriel:
Evaluating the effort of building a Machine Learning model for malware detection from ground zero. 365-370 - Alina Carunta, Mihai Plesu:
On Measuring the Dissimilarity between Biological Sequences. 371-374
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.