Counting Database Repairs under Primary Keys Revisited

Συγγραφείς: Marco Calautti, Marco Console, Andreas Pieris

Πηγή: Calautti, M, Console, M & Pieris, A 2019, Counting Database Repairs under Primary Keys Revisited. in Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. New York, pp. 104-118, ACM SIGMOD/PODS International Conference on Management of Data (SIGMOD 2019), Amsterdam, Netherlands, 30/06/19. https://doi.org/10.1145/3294052.3319703

Θεματικοί όροι: Inconsistency, repairs, primary keys, first-order queries, counting, complexity, approximation schemes, Numeric approximation algorithms, Approximation schemes, Complexity, Counting, First-order queries, Inconsistency, Primary keys, Repairs, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Inconsistent data, repairs, primary keys, first-order queries, counting, complexity, approximation schemes, 01 natural sciences

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://www.pure.ed.ac.uk/ws/files/84254105/Counting_Database_Repairs_CALAUTTI_DoA100319_AFV.pdf
https://ceur-ws.org/Vol-2400/paper-41.pdf
https://hdl.handle.net/2434/953304
https://doi.org/10.1145/3294052.3319703
https://hdl.handle.net/20.500.11820/e578c5ef-739e-4f2a-b1a8-e24c517373ce
https://www.research.ed.ac.uk/en/publications/e578c5ef-739e-4f2a-b1a8-e24c517373ce
https://doi.org/10.1145/3294052.3319703
https://www.pure.ed.ac.uk/ws/files/84254105/Counting_Database_Repairs_CALAUTTI_DoA100319_AFV.pdf
https://dl.acm.org/citation.cfm?doid=3294052.3319703
https://hdl.handle.net/11572/260155
http://ceur-ws.org/Vol-2400/paper-41.pdf
https://hdl.handle.net/11573/1501968
https://doi.org/10.1145/3294052.3319703

Error Analysis of Some Operations Involved in the Cooley-Tukey Fast Fourier Transform

Συγγραφείς: Brisebarre, Nicolas, Joldes, Mioara, Muller, Jean-Michel, Naneş, Ana-Maria, Picot, Joris

Συνεισφορές: Muller, Jean-Michel, Arithmetic and Computing (ARIC), Centre Inria de l'Université Grenoble Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon), Université de Lyon-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS), Équipe Méthodes et Algorithmes en Commande (LAAS-MAC), Laboratoire d'analyse et d'architecture des systèmes (LAAS), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Technical University of Cluj-Napoca, ANR-14-CE25-0018,Fast Relax,Approximation rapide et fiable(2014)

Πηγή: ACM Transactions on Mathematical Software. 46:1-27

Θεματικοί όροι: [INFO.INFO-AO]Computer Science [cs]/Computer Arithmetic, Numeric approximation algorithms, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], Fast Fourier Transform, Floating-point arithmetic, 01 natural sciences, [INFO.INFO-OH] Computer Science [cs]/Other [cs.OH], Rounding error analysis, • Theory of computation → Design and analysis of algorithms, Additional Key Words and Phrases: Floating-point arithmetic, Rounding error analysis ACM Reference format, CCS Concepts: • Mathematics of computing → Mathematical software, [INFO.INFO-AO] Computer Science [cs]/Computer Arithmetic, 0101 mathematics

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://hal.archives-ouvertes.fr/hal-01949458v2/file/Bounds-FFT-HaLV2-oct19.pdf
https://hal.science/hal-01949458v2/document
https://doi.org/10.1145/3368619
https://hal.science/hal-01949458v2

A Massively Parallel Algorithm for the Approximate Calculation of Inverse p-th Roots of Large Sparse Matrices

Συγγραφείς: Lass, Michael, Mohr, Stephan, Wiebeler, Hendrik, Kühne, Thomas D., Plessl, Christian

Συνεισφορές: Barcelona Supercomputing Center

Πηγή: Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Proceedings of the Platform for Advanced Scientific Computing Conference on-PASC '18
Proceedings of the Platform for Advanced Scientific Computing Conference

Θεματικοί όροι: FOS: Computer and information sciences, Parallel algorithms, Computations on matrices, Numeric approximation algorithms, Applied computing, Numerical Analysis (math.NA), Mathematics of computing, 01 natural sciences, Computing methodologies, Algorismes paral·lels, Supercomputadors, Computer Science - Distributed, Parallel, and Cluster Computing, Informàtica [Àrees temàtiques de la UPC], Massively parallel algorithms, FOS: Mathematics, Distributed algorithms, Computer Science - Mathematical Software, Mathematics - Numerical Analysis, Distributed, Parallel, and Cluster Computing (cs.DC), Àrees temàtiques de la UPC::Informàtica, Computational methods in engineering, 0101 mathematics, Mathematical Software (cs.MS), Theory of computation

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://upcommons.upc.edu/bitstream/2117/120202/1/A%20Massively%20Parallel%20Algorithm%20for%20the%20Approximate%20Calculation.pdf
http://arxiv.org/abs/1710.10899
http://hdl.handle.net/2117/120202
https://hdl.handle.net/2117/120202
https://doi.org/10.1145/3218176.3218231

A Certified Lower Bounds of Roundoff Errors using Semidefinite Programming

Συγγραφείς: Magron, Victor, Farid, Mountassir

Συνεισφορές: VERIMAG (VERIMAG - IMAG), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes 2016-2019 (UGA 2016-2019 ), ANR-11-LABX-0025,PERSYVAL-lab,Systemes et Algorithmes Pervasifs au confluent des mondes physique et numérique(2011)

Πηγή: https://hal.science/hal-01448160 ; 2017.

Θεματικοί όροι: Numeric approximation algorithms, Mathematical optimization, Continuous optimization, Semidefinite programming, Convex optimization, polynomial optimization, floating-point arithmetic, Generalized Eigenvalue, robust optimization, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]

Διαθεσιμότητα: https://hal.science/hal-01448160
https://hal.science/hal-01448160v1/document
https://hal.science/hal-01448160v1/file/1611.01318v2.pdf

A Massively Parallel Algorithm for the Approximate Calculation of Inverse p-th Roots of Large Sparse Matrices

Συγγραφείς: Barcelona Supercomputing Center, Lass, Michael, Mohr, Stephan, Wiebeler, Hendrik, Kühne, Thomas D., Plessl, Christian

Όροι ευρετηρίου: Àrees temàtiques de la UPC::Informàtica, Parallel algorithms, Computational methods in engineering, Mathematics of computing, Computations on matrices, Theory of computation, Numeric approximation algorithms, Massively parallel algorithms, Distributed algorithms, Computing methodologies, Applied computing, Algorismes paral·lels, Supercomputadors, Conference lecture

Σύνδεσμος: https://hdl.handle.net/2117/120202
https://dl.acm.org/citation.cfm?id=3218231
https://dl.acm.org/citation.cfm?id=3218231
info:eu-repo/grantAgreement/EC/H2020/716142/EU/Unravelling the Nature of Green Organic “On-Water” Catalysis via Novel Quantum Chemical Methods/GreenOnWaterCat