Search Results - "Approximation complexity"
-
1
Authors:
Source: SIAM/ASA Journal on Uncertainty Quantification. 13:425-448
Subject Terms: flux, McKean-Vlasov SDEs, deep neural networks, approximation complexity, rectified quadratic unit activations, Rate of convergence, degree of approximation, Artificial neural networks and deep learning, statistical inference
File Description: application/xml
-
2
Authors:
Contributors:
Source: Theoretical Computer Science. 1055:115502
Subject Terms: Approximation Complexity, Arborescence, Graph Algorithms, Parameterized Complexity, Temporal Graphs, ddc:004
File Description: application/pdf
-
3
Authors:
Contributors:
Subject Terms: FOS: Computer and information sciences, Computer Science - Computational Complexity, Approximation Complexity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Temporal Graphs, Graph Algorithms, Graph Separators, ddc:004, Computational Complexity (cs.CC), Parameterized Complexity
File Description: application/pdf
-
4
Authors:
Source: Theory of Computing Systems. 68:227-249
Subject Terms: Complexity of proofs, Horn constraints, copy complexity, linear refutation, approximation complexity
File Description: application/xml
-
5
Authors:
Source: Network Science. 11:615-631
Subject Terms: graph algorithms, Temporal graphs, approximation complexity, graph mining, heuristics, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences
File Description: application/pdf
-
6
Authors:
Contributors:
Subject Terms: Approximation Complexity, Arborescence, Graph Algorithms, Parameterized Complexity, Temporal Graphs, ddc:004
File Description: application/pdf
-
7
Authors:
Source: Neural Networks. 153:269-281
Subject Terms: FOS: Computer and information sciences, Computer Science - Machine Learning, Approximation complexity, Communication, Signal Processing, Computer-Assisted, Machine Learning (stat.ML), Numerical Analysis (math.NA), 02 engineering and technology, 01 natural sciences, Machine Learning (cs.LG), Statistics - Machine Learning, Besov spaces, Shift-invariant spaces, Sobolev spaces, Deep neural networks, Image Processing, Computer-Assisted, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Mathematics - Numerical Analysis, Neural Networks, Computer, 0101 mathematics
-
8
Authors:
Source: AIMS Mathematics, Vol 7, Iss 10, Pp 19018-19025 (2022)
-
9
Authors:
Source: Neural Networks. 145:144-154
Subject Terms: FOS: Computer and information sciences, Computer Science - Machine Learning, Approximation complexity, Generative adversarial networks, Probability (math.PR), Mathematics - Statistics Theory, Machine Learning (stat.ML), Statistics Theory (math.ST), 02 engineering and technology, 01 natural sciences, Deep ReLU networks, Machine Learning (cs.LG), Maximum mean discrepancy, Statistics - Machine Learning, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Wasserstein distance, Neural Networks, Computer, 0101 mathematics, Mathematics - Probability, Probability
Access URL: https://pubmed.ncbi.nlm.nih.gov/34749027
http://arxiv.org/abs/2101.12353
https://dblp.uni-trier.de/db/journals/corr/corr2101.html#abs-2101-12353
https://arxiv.org/pdf/2101.12353
https://arxiv.org/abs/2101.12353
https://www.sciencedirect.com/science/article/pii/S0893608021004032
https://europepmc.org/article/MED/34749027 -
10
Authors: et al.
Contributors: et al.
Source: Discrete Applied Mathematics. 280:23-42
Subject Terms: Approximation complexity, 0211 other engineering and technologies, Parameterized complexity, tractability and kernelization, classical complexity, 0102 computer and information sciences, 02 engineering and technology, 16. Peace & justice, 01 natural sciences, Classical complexity, Planar graphs, geometric and topological aspects of graph theory, Domination chain, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), approximation complexity, Graph algorithms (graph-theoretic aspects), parameterised complexity, Modèles mathématiques. Algorithmes, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Parameterised complexity, domination chain, special graph classes, Special graph classes
File Description: application/xml; application/pdf
-
11
Authors: et al.
Contributors: et al.
Subject Terms: FOS: Computer and information sciences, Scheduling, Scheduling Approximation Complexity, [INFO]Computer Science [cs], Data Structures and Algorithms (cs.DS), Complexity, F.2.2, [INFO] Computer Science [cs], Approximation
File Description: application/pdf
-
12
Authors:
Source: Studies in Computational Intelligence ISBN: 9783030934088
Subject Terms: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Temporal graphs, Algorithms on graphs, Algorithms for network analysis, Heuristics, Approximation complexity, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences
File Description: application/pdf
-
13
Authors: et al.
Contributors: et al.
Source: Theoretical Computer Science. 766:1-15
Subject Terms: FOS: Computer and information sciences, Approximation complexity, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Distinguishing Transversal, [INFO] Computer Science [cs], Hypergraphs, 01 natural sciences, Parameterized complexity, Computer Science - Data Structures and Algorithms, Partial problems, VC dimension, Data Structures and Algorithms (cs.DS), Recherche opérationnelle
File Description: application/pdf
Access URL: https://www.sciencedirect.com/science/article/am/pii/S030439751830584X
http://arxiv.org/abs/1609.05110
https://hal.archives-ouvertes.fr/hal-02091342/document
https://arxiv.org/pdf/1609.05110v3
https://www.sciencedirect.com/science/article/pii/S030439751830584X
https://arxiv.org/abs/1609.05110
http://ui.adsabs.harvard.edu/abs/2016arXiv160905110B/abstract
https://hal.archives-ouvertes.fr/hal-02091342
https://hal.science/hal-02091342v1/document
https://hal.science/hal-02091342v1
https://doi.org/10.1016/j.tcs.2018.09.013 -
14
Authors:
Source: Theoretical Computer Science. 511:159-171
Subject Terms: l-Diversity, k-Anonymity, approximation complexity, parameterized complexity, l-Diversity, k-Anonymity, Approximation complexity, Parameterized complexity, Approximation complexity, Parameterized complexity, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences
Access URL: https://boa.unimib.it/handle/10281/48652
https://dl.acm.org/doi/10.1016/j.tcs.2012.05.024
https://dblp.uni-trier.de/db/journals/tcs/tcs511.html#DondiMZ13
https://aisberg.unibg.it/handle/10446/29568
https://www.sciencedirect.com/science/article/pii/S0304397512004823
https://hdl.handle.net/10281/48652
https://doi.org/10.1016/j.tcs.2012.05.024
https://hdl.handle.net/10446/29568
http://www.journals.elsevier.com/theoretical-computer-science
https://doi.org/10.1016/j.tcs.2012.05.024 -
15
Authors:
Contributors:
Source: Journal of Complexity. 31:659-674
Subject Terms: [MATH.MATH-PR] Mathematics [math]/Probability [math.PR], Approximation complexity, Probability (math.PR), Gaussian processes, Numerical Analysis (math.NA), [MATH.MATH-NA] Mathematics [math]/Numerical Analysis [math.NA], Additive random fields, 16. Peace & justice, 7. Clean energy, 01 natural sciences, 65Y20, 13. Climate action, Tensor product random fields, FOS: Mathematics, Standard information, Mathematics - Numerical Analysis, 0101 mathematics, Mathematics - Probability
File Description: application/pdf
Access URL: http://arxiv.org/abs/1402.5489
https://www.sciencedirect.com/science/article/pii/S0885064X15000588
http://www.diva-portal.org/smash/record.jsf?pid=diva2:855144
https://dblp.uni-trier.de/db/journals/jc/jc31.html#LifshitsZ15
https://www.sciencedirect.com/science/article/abs/pii/S0885064X15000588 -
16
Authors:
Source: Journal of Discrete Algorithms. 33:115-129
Subject Terms: 0206 medical engineering, Approximation complexity, Computational biology, Gene tree correction, Gene tree reconciliation, Parameterized complexity, Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Theoretical Computer Science, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences
File Description: application/pdf
Access URL: https://dblp.uni-trier.de/db/journals/jda/jda33.html#BerettaCD15
https://run.unl.pt/handle/10362/71192
https://core.ac.uk/display/157639352
https://www.sciencedirect.com/science/article/abs/pii/S1570866715000489
https://doi.org/10.1016/j.jda.2015.03.005
https://aisberg.unibg.it/handle/10446/56201 -
17
Authors: et al.
Source: Lecture Notes in Computer Science ISBN: 9783319946665
Subject Terms: FOS: Computer and information sciences, approximation complexity, cohesive subgraphs, graph covering, 13. Climate action, Theoretical Computer Science, Computer Science, Algorithms, s-Clubs, Computer Science - Data Structures and Algorithms, 0211 other engineering and technologies, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences
File Description: application/pdf
Access URL: http://arxiv.org/pdf/1806.01119
http://arxiv.org/abs/1806.01119
https://link.springer.com/chapter/10.1007/978-3-319-94667-2_13
https://www.arxiv-vanity.com/papers/1806.01119/
https://aisberg.unibg.it/handle/10446/132420
https://boa.unimib.it/handle/10281/203717
https://basepub.dauphine.fr/handle/123456789/18540
https://dblp.uni-trier.de/db/journals/corr/corr1806.html#abs-1806-01119
https://www.springer.com/series/558
https://hdl.handle.net/10281/203717
https://doi.org/10.1007/978-3-319-94667-2_13
https://hdl.handle.net/10446/132420
https://doi.org/10.1007/978-3-319-94667-2_13 -
18
Authors: DONDI, Riccardo
Source: Discrete Applied Mathematics. 160:1299-1310
Subject Terms: Applied Mathematics, 0211 other engineering and technologies, Discrete Mathematics and Combinatorics, Computational biology, Haplotyping, Approximation complexity, Fixed-parameter algorithms, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences
Access URL: https://aisberg.unibg.it/handle/10446/27158
http://dblp.uni-trier.de/db/journals/dam/dam160.html#Dondi12
https://dblp.uni-trier.de/db/journals/dam/dam160.html#Dondi12
https://www.sciencedirect.com/science/article/pii/S0166218X11003891
https://www.sciencedirect.com/science/article/abs/pii/S0166218X11003891
https://hdl.handle.net/10446/27158
http://www.journals.elsevier.com/discrete-applied-mathematics
https://doi.org/10.1016/j.dam.2011.10.014 -
19
Approximation Results for Kinetic Variants of TSP: Approximation results for kinetic variants of TSP
Authors:
Source: Lecture Notes in Computer Science ISBN: 9783540662242
Subject Terms: 0209 industrial biotechnology, Datavetenskap (datalogi), Computer Sciences, approximation complexity, Analysis of algorithms and problem complexity, Graph theory (including graph drawing) in computer science, Computer graphics, computational geometry (digital and algorithmic aspects), traveling salesman problem, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences
File Description: application/xml; application/pdf
Access URL: https://link.springer.com/content/pdf/10.1007%2Fs00454-001-0081-4.pdf
https://mau.diva-portal.org/smash/get/diva2:1399378/FULLTEXT01.pdf
https://zbmath.org/1784791
https://doi.org/10.1007/s00454-001-0081-4
https://dblp.uni-trier.de/db/conf/icalp/icalp99.html#HammarN99
https://portal.research.lu.se/en/publications/approximation -results-for-kinetic-variants-of-tsp
https://rd.springer.com/chapter/10.1007/3-540-48523-6_36
http://www.diva-portal.org/smash/record.jsf?pid=diva2:1399378
https://link.springer.com/chapter/10.1007%2F3-540-48523-6_36
https://link.springer.com/10.1007%2F3-540-48523-6_36
http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-2615 -
20
Authors:
Contributors:
Source: Journal of Complexity. 24:362-379
Subject Terms: Curse of dimensionality, Statistics and Probability, [MATH.MATH-PR] Mathematics [math]/Probability [math.PR], Numerical Analysis, Approximation complexity, Algebra and Number Theory, Control and Optimization, Applied Mathematics, Tractability, Linear approximation error, Gaussian processes, 01 natural sciences, Random fields, 0101 mathematics
File Description: application/pdf
Nájsť tento článok vo Web of Science 
Full Text Finder