default search action
23rd SYNASC 2021: Timisoara, Romania
- Carsten Schneider, Mircea Marin, Viorel Negru, Daniela Zaharie:
23rd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2021, Timisoara, Romania, December 7-10, 2021. IEEE 2021, ISBN 978-1-6654-0650-5 - Cristian S. Calude:
Gödel Incompleteness and Proof-Assistants Extended Abstract. 1-3 - Gereon Kremer, Jens Brandt:
Implementing arithmetic over algebraic numbers A tutorial for Lazard's lifting scheme in CAD. 4-10 - Raqeeb Rasheed:
Resultant-based Elimination for Skew Polynomials. 11-18 - D. J. Jeffrey:
Tree $T$ and Lambert $W$. 19-24 - Tateaki Sasaki, Masaru Sanuki, Daiju Inaba:
Proposal of Multivariate Polynomial Arithmetic in a Specified Width of High- or Low-Exponents. 25-32 - Siyuan Deng, Greg Reid, D. J. Jeffrey:
Parametric Linear Algebra in Maple: Reduced Row Echelon Form. 33-36 - Gereon Kremer, Erika Ábrahám, Matthew England, James H. Davenport:
On the Implementation of Cylindrical Algebraic Coverings for Satisfiability Modulo Theories Solving. 37-39 - Abdelqoddous Moussa, Olivier D. Lafitte:
Uncertainty treatment of a coupled model of thermohydraulics and neutronics using special functions solutions. 40-44 - Stef Graillat, Fabienne Jézéquel, Enzo Queiros Martins, Maxime Spyropoulos:
Computing multiple roots of polynomials in stochastic arithmetic with Newton method and approximate GCD. 45-51 - Daniel J. Bates, David Eklund, Jonathan D. Hauenstein, Chris Peterson:
Excess intersections and numerical irreducible decompositions. 52-60 - François Dubois, Olivier D. Lafitte:
An analytic and symbolic analysis of a coupled thermo-neutronic problem. 61-65 - Rasmus Rendal Kjær, Magnus Holm Lundbergh, Magnus Mantzius, Hans Hüttel:
An Editor Calculus With Undo/Redo. 66-74 - David M. Cerna:
A Special Case of Schematic Syntactic Unification. 75-82 - Stefan Andrei, Albert M. K. Cheng, Vlad Radulescu:
Designing a New Soft-Hard Task Model for Scheduling Real-Time Systems on a Multiprocessor Platform. 83-90 - Christoph Koutschan, Anton Ponomarchuk, Josef Schicho:
Approximation of convex polygons by polygons. 91-98 - Dan A. Simovici, Joshua Yee:
Ultrametrics and Outlier Identification. 99-104 - Ada-Astrid Mocanu, Adrian Iftene:
How the Events in the Life of Painters Influence the Colors of their Paintings. 105-112 - Maria-Minerva Vonica, Andrei Ancuta, Marc Frîncu:
Glacier Movement Prediction through Computer Vision and Satellite Imagery. 113-120 - Costin-Gabriel Chiru, Ciprian-Octavian Truica, Elena Simona Apostol, Alexandru Ionescu:
Improving WordNet using Word Embeddings. 121-128 - Bilal Hoteit, Imad Alex Awada, Alexandru Sorici, Adina Magda Florea:
Continuous Operations and Fully Autonomy of a Social Service Robotic System. 129-134 - Abdullah Khan, Alexei Vernitski, Alexei Lisitsa:
Untangling Braids with Multi-Agent Q-Learning. 135-139 - Cristiana Vladescu, Maria-Alexandra Dinisor, Octavian Grigorescu, Dragos Corlatescu, Cristian Sandescu, Mihai Dascalu:
What are the Latest Cybersecurity Trends? A Case Study Grounded in Language Models. 140-146 - Deena Awny:
Relation Extraction - A Study on Kernel Functions. 147-154 - Mihai-Dimitrie Minut, Adrian Iftene:
Creating a Dataset and Models Based on Convolutional Neural Networks to Improve Fruit Classification. 155-162 - Diana-Lucia Miholca:
New Conceptual Cohesion Metrics: Assessment for Software Defect Prediction. 163-170 - Ion Babalau, Dragos Corlatescu, Octavian Grigorescu, Cristian Sandescu, Mihai Dascalu:
Severity Prediction of Software Vulnerabilities based on their Text Description. 171-177 - Jean-Marc Brossier, Olivier D. Lafitte:
Combining weak classifiers: a logical analysis. 178-181 - Darian M. Onchis, Ioan-Valentin Samuila:
Double distillation for class incremental learning. 182-185 - Lorenzo Capra:
An Efficient Maude Formalization of (Rewritable) PT Nets. 186-193 - Eneia Nicolae Todoran:
Equivalence Classes in Performance Evaluation Programming. 194-199 - Liliana Cojocaru:
Towards the Complexity of Petri Nets and One Counter Machines via Coordinated Table Selective Substitution Systems. 200-207 - Marcin Jurkiewicz, Krzysztof Pastuszak, Mateusz Szypulski:
Graphs hard-to-process for greedy algorithm MIN. 208-213 - Togoe Nicolae-Bogdan-Cristian, Ciprian Pungila:
The Cleisthenes Protocol: A Fair Governance-Based Democratic Consensus Algorithm. 214-221 - Sorin Valcan:
Convolutional Neural Network Training System For Eye Location On Infrared Driver Recordings Using Automatically Generated Ground Truth Data. 222-226 - Esmitt Ramírez, Carles Sanchéz Ramos, Debora Gil:
BronchoX-Cloud: A Diagnostic as a Service Cloud Platform for Planning and Navigation Bronchoscopy. 227-233 - Sebastian-Aurelian Stefaniga:
Methods of acceleration for feature extractions in medical imaging using GPU processing. 234-241 - Alexandru Ionascu:
Extracting football players video sprites from broadcast video. 242-245 - Ruxandra Stoean, Nebojsa Bacanin, Leonard Ionescu, Marinela Boicea, Alina-Maria Garau, Cristina-Camelia Ghitescu:
Semantic Segmentation for Corrosion Detection in Archaeological Artefacts before Restoration. 246-251 - Catalin Stoean, Daniel Lichtblau:
Sentiment Analysis from Stock Market News in Romanian using Chaos Game Representation. 252-258 - Miodrag Zivkovic, Catalin Stoean, Aleksandar Petrovic, Nebojsa Bacanin, Ivana Strumberger, Tamara Zivkovic:
A Novel Method for COVID-19 Pandemic Information Fake News Detection Based on the Arithmetic Optimization Algorithm. 259-266 - Alexandru-Ioan Lungu:
Extended Z3 Array. 267-274 - Ioana Leustean, Bogdan Macovei:
DELP: Dynamic Epistemic Logic for Security Protocols. 275-282 - Mihai Prunescu:
Secure Multiparty Computation in arbitrary rings. 283-290 - Madalina-Andreea Mitran:
Analysis of the Influence of Bound Constraint Handling Strategies on the Search Direction in Differential Evolution Algorithms. 291-298
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.