Výsledky vyhľadávania - F.2.2 Nonnumerical algorithms and problems*

Validator-Grade Resolution of Quantum Field Theory and Gravity via Spectral Geometry, Numerical Realization, and Cryptographic Attestation

Autori: Forrest M. Anderson, Forrest

Predmety: • Category Theory • Spectral Geometry • Noncommutative Geometry • Quantum Field Theory (QFT) • General Relativity • Gravity Quantization • Spectral Triple • Fluctuated Dirac Operator • Spectral Action Principle • Algebraic Unification • Gauge-Gravity Duality • Fermionic Bilinear • Operator-Theoretic Physics • Geometric Quantization • Mathematical Physics • Finite Element Method (FEM) • Spectral Approximation • Numerical Convergence • Bilinear Projection • Mesh Refinement • Sobolev Spaces • Eigenvalue Stability • Trace-Class Operators • Discretized Manifolds • Symbolic-to-Numerical Translation • IEEE 754 Compliance • Canonical Encoding • Deterministic Replay • Merkle Manifest • Cryptographic Attestation • Inclusion Proofs • Validator-Grade Verification • Reproducible Computation • Scientific Integrity • Manifest-Based Replication • MSC 81Txx – Quantum Theory • MSC 53Cxx – Differential Geometry • MSC 58Jxx – Partial Differential Equations on Manifolds • MSC 65N30 – FEM, PDEs • MSC 68P25 – Data Encoding and Compression • MSC 68Q87 – Cryptographic Protocols • ACM G.1.8 – Partial Differential Equations • ACM F.2.2 – Nonnumerical Algorithms and Problems • ACM D.4.6 – Security and Protection • ACM I.1.1 – Symbolic and Algebraic Manipulation • Alain Connes • Matilde Marcolli • Ivo Babuška • Ralph Merkle • IEEE Standards Association • Dan Boneh • Victor Shoup • Victoria Stodden • Gavin Wood • Scientific Reproducibility • Validator Framework • Cryptographic Verification • Open Science • Zenodo • arXiv • CERN • Mathematical Institute • Department of Applied Mathematics • Institute for Advanced Study

Relation: https://zenodo.org/records/17262968; oai:zenodo.org:17262968; https://doi.org/10.5281/zenodo.17262968

Dostupnosť: https://doi.org/10.5281/zenodo.17262968
https://zenodo.org/records/17262968

Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF

Autori: Olaf Beyersdorff Joshua Blinkhorn Leroy Chew a ďalší

Zdroj: J Autom Reason
Beyersdorff, O, Blinkhorn, J, Leroy Chew, Schmidt, R & Suda, M 2018, 'Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF', Journal of Automated Reasoning, vol. 63, no. 0, pp. 597–623. https://doi.org/10.1007/s10817-018-9482-4
Journal of Automated Reasoning

Predmety: Dependency schemes, 0202 electrical engineering, electronic engineering, information engineering, DQBF, Quantified Boolean formulas, 0102 computer and information sciences, 02 engineering and technology, F.2.2 Nonnumerical algorithms and problems, 01 natural sciences, Article

Prístupová URL adresa: https://link.springer.com/content/pdf/10.1007%2Fs10817-018-9482-4.pdf
https://pubmed.ncbi.nlm.nih.gov/31496547
https://www.research.manchester.ac.uk/portal/en/publications/reinterpreting-dependency-schemes-soundness-meets-incompleteness-in-dqbf(c21330aa-c463-4cf7-b62a-9963d26aaad7).html
https://link.springer.com/content/pdf/10.1007/s10817-018-9482-4.pdf
https://europepmc.org/article/PMC/PMC6710225
https://link.springer.com/article/10.1007/s10817-018-9482-4
https://dblp.uni-trier.de/db/journals/jar/jar63.html#BeyersdorffBCSS19
https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6710225

Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs

Autori: Antunes, Daniel Mathieu, Claire Mustafa, Nabil a ďalší

Prispievatelia: Antunes, Daniel Mathieu, Claire Mustafa, Nabil a ďalší

Zdroj: Leibniz International Proceedings in Informatics (LIPIcs) ; 25th Annual European Symposium on Algorithms (ESA 2017) ; https://hal.science/hal-01740357 ; 25th Annual European Symposium on Algorithms (ESA 2017), Sep 2017, Vienna, Austria. ⟨10.4230/LIPIcs.ESA.2017.8⟩

Predmety: Combinatorial Optimization, Expansion, Hall's Theorem, Local Search, Planar Graphs, ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems, [SCCO.COMP]Cognitive science/Computer science

Geografické téma: Vienna, Austria

Dostupnosť: https://hal.science/hal-01740357
https://hal.science/hal-01740357v1/document
https://hal.science/hal-01740357v1/file/radiuslocalsearch.pdf
https://doi.org/10.4230/LIPIcs.ESA.2017.8

Scalable Algorithms for Large High-Resolution Terrain Data

Autori: Thomas Mølhave Pankaj K. Agarwal Lars Arge a ďalší

Prispievatelia: Thomas Mølhave Pankaj K. Agarwal Lars Arge a ďalší

Zdroj: http://www.cs.duke.edu/~pankaj/publications/papers/comgeo.pdf.

Predmety: Categories and Subject Descriptors, D.2 [Software, Software Engineering, F.2.2 [Nonnumerical Algorithms and Problems, Geometrical problems and computations, H.2.8 [Database Management, Database Applications—Data Mining, Image Databases, Spatial Databases and GIS General Terms, Performance, Algorithms Keywords, LIDAR, Massive data, GIS

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.294.7693; http://www.cs.duke.edu/~pankaj/publications/papers/comgeo.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.294.7693
http://www.cs.duke.edu/~pankaj/publications/papers/comgeo.pdf

A Survey of Pipelined Workflow Scheduling: Models and Algorithms

Autori: Anne Benoit Ümit V. Çatalyürek Yves Robert a ďalší

Prispievatelia: Anne Benoit Ümit V. Çatalyürek Yves Robert a ďalší

Zdroj: http://bmi.osu.edu/~esaule/public-website/papers/acmcs12-BCRS.pdf.

Predmety: Categories and Subject Descriptors, F.2.2 [Nonnumerical Algorithms and Problems, Sequencing and scheduling, C.1.4 [Parallel Architectures, Distributed architectures General Terms, Algorithms, Performance, Theory Additional Key Words and Phrases, workflow programming, filter-stream programming, scheduling, pipeline, throughput, latency, models, distributed systems, parallel systems

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.301.1343

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.301.1343
http://bmi.osu.edu/~esaule/public-website/papers/acmcs12-BCRS.pdf

Approximating connectivity augmentation problems

Autori: Zeev Nutov The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Zeev Nutov The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.openu.ac.il/home/nutov/TALG09.pdf.

Predmety: Categories and Subject Descriptors, F.2.2 [Nonnumerical Algorithms and Problems, Computations on discrete structures, G.2.2 [Discrete Mathematics, Graph Algorithms General Terms, Approximation Algorithms, Hardness of Approximation Additional Key Words and Phrases, connectivity augmentation, element-connectivity, nodeconnectivity

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.403.8841; http://www.openu.ac.il/home/nutov/TALG09.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.403.8841
http://www.openu.ac.il/home/nutov/TALG09.pdf

Editorial - Journal of Discrete Algorithms

Autori: Grossi R Sebastiani F Silvestri F

Zdroj: Journal of discrete algorithms
18 (2013): 1–2. doi:10.1016/j.jda.2012.12.008
info:cnr-pdr/source/autori:Grossi R.; Sebastiani F.; Silvestri F./titolo:Editorial-Journal of Discrete Algorithms/doi:10.1016%2Fj.jda.2012.12.008/rivista:Journal of discrete algorithms (Print)/anno:2013/pagina_da:1/pagina_a:2/intervallo_pagine:1–2/volume:18

Predmety: F.2.2 Nonnumerical Algorithms and Problems, String processing, H.3 INFORMATION STORAGE AND RETRIEVAL

Popis súboru: application/pdf

Better Scalable Algorithms for Broadcast Scheduling

Autori: Nikhil Bansal RAVISHANKAR KRISHNASWAMY VISWANATH NAGARAJAN a ďalší

Prispievatelia: Nikhil Bansal RAVISHANKAR KRISHNASWAMY VISWANATH NAGARAJAN a ďalší

Zdroj: http://www.cs.cmu.edu/~ravishan/files/papers/broadcast.pdf.

Predmety: Categories and Subject Descriptors, F.2.2 [Nonnumerical Algorithms and Problems, Sequencing and Scheduling General Terms, Algorithms Additional Key Words and Phrases, Online Algorithms, Broadcast Scheduling, Resource Augmentation ACM Reference Format

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.296.5554; http://www.cs.cmu.edu/~ravishan/files/papers/broadcast.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.296.5554
http://www.cs.cmu.edu/~ravishan/files/papers/broadcast.pdf

Detecting dense communities in large social and information networks with the Core & Peel algorithm

Autori: Pellegrini, Marco Geraci, Filippo Baglioni, Miriam

Predmety: Social and Information Networks (cs.SI), FOS: Computer and information sciences, Physics - Physics and Society, F.2.2 Nonnumerical Algorithms and Problems, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, FOS: Physical sciences, Computer Science - Social and Information Networks, Data Structures and Algorithms (cs.DS), 02 engineering and technology, Physics and Society (physics.soc-ph)

Prístupová URL adresa: http://arxiv.org/abs/1210.3266

Longest Common Substring with Approximately k Mismatches

Autori: Starikovskaya, Tatiana Département d'informatique - ENS Paris (DI-ENS) École normale supérieure - Paris (ENS-PSL) a ďalší

Prispievatelia: Starikovskaya, Tatiana Département d'informatique - ENS Paris (DI-ENS) École normale supérieure - Paris (ENS-PSL) a ďalší

Zdroj: 27th Annual Symposium on Combinatorial Pattern Matching CPM 2016
https://hal.science/hal-03942914
27th Annual Symposium on Combinatorial Pattern Matching CPM 2016, 2016, Warsaw, Poland. ⟨10.4230/LIPIcs.CPM.2016.21⟩

Predmety: 1998 ACM Subject Classification F.2.2. Nonnumerical Algorithms and Problems phrases Randomised algorithms string similarity measures longest common substring sketching locality-sensitive hashing, string similarity measures, longest common substring, sketching, locality-sensitive hashing, [INFO]Computer Science [cs]

Geografické téma: Warsaw, Poland

Relation: hal-03942914; https://hal.science/hal-03942914; https://hal.science/hal-03942914/document; https://hal.science/hal-03942914/file/LIPIcs-CPM-2016-21.pdf

Dostupnosť: https://hal.science/hal-03942914
https://hal.science/hal-03942914/document
https://hal.science/hal-03942914/file/LIPIcs-CPM-2016-21.pdf
https://doi.org/10.4230/LIPIcs.CPM.2016.21

Categories and Subject Descriptors: F.2.2 [Nonnumerical Algorithms and Problems]: Computations on discrete structures; Sequencing and scheduling

Prispievatelia: The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.research.att.com/~dsj/papers/sumsqj.ps.

Predmety: General Terms, Algorithms, Experimentation, Theory Additional Key Words and Phrases, Approximation algorithms, average case analysis, bin packing

Popis súboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.73.1258; http://www.research.att.com/~dsj/papers/sumsqj.ps

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.73.1258
http://www.research.att.com/~dsj/papers/sumsqj.ps

Approximation Schemes for Clustering Problems (Extended Abstract)

Autori: W. Fernandez de la Vega Marek Karpinski Claire Kenyon a ďalší

Prispievatelia: W. Fernandez de la Vega Marek Karpinski Claire Kenyon a ďalší

Zdroj: http://www.cs.brown.edu/research/pubs/pdfs/2003/delaVega-2003-ASC.pdf.

Predmety: F.2.2 [Nonnumerical Algorithms and Problems, Geometrical

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.186.4838

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.186.4838
http://www.cs.brown.edu/research/pubs/pdfs/2003/delaVega-2003-ASC.pdf

Extraction and classification of dense implicit communities in the Web graph

Autori: Dourisboure Y Geraci F Pellegrini M

Zdroj: ACM transactions on the web 3 (2009). doi:10.1145/1513876.1513879
info:cnr-pdr/source/autori:Dourisboure Y.; Geraci F.; Pellegrini M./titolo:Extraction and classification of dense implicit communities in the Web Graph/doi:10.1145%2F1513876.1513879/rivista:ACM transactions on the web/anno:2009/pagina_da:/pagina_a:/intervallo_pagine:/volume:3

Predmety: communities, H.2.8 Database applications. Clustering, web graph, detection of dense subgraph, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, F.2.2 Nonnumerical Algorithms and Problems. Computations on discrete structures

Prístupová URL adresa: http://wwwold.iit.cnr.it/staff/marco.pellegrini/papiri/jv-cybercom-draft2.pdf
https://dl.acm.org/doi/10.1145/1513876.1513879
https://dblp.uni-trier.de/db/journals/tweb/tweb3.html#DourisboureGP09
https://doi.org/10.1145/1513876.1513879
http://wwwold.iit.cnr.it/staff/marco.pellegrini/papiri/jv-cybercom-draft2.pdf
https://hdl.handle.net/20.500.14243/46197
https://doi.org/10.1145/1513876.1513879

On the sum-of-squares algorithm for bin packing

Autori: Janos Csirik David S. Johnson Claire Kenyon a ďalší

Prispievatelia: Janos Csirik David S. Johnson Claire Kenyon a ďalší

Zdroj: http://jorlin.scripts.mit.edu/docs/publications/88-BinPacking.pdf.

Predmety: Categories and Subject Descriptors, F.2.2 [Nonnumerical Algorithms and Problems, Computations on discrete structures, Sequencing and scheduling General Terms, Algorithms, Experimentation, Theory Additional Key Words and Phrases, Approximation algorithms, average case analysis, bin packing

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.3673

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.3673
http://jorlin.scripts.mit.edu/docs/publications/88-BinPacking.pdf

A Subdivision-Based Algorithm for the Sparse Resultant

Autori: John F. Canny Ioannis Z. Emiris The Pennsylvania State University CiteSeerX Archives

Prispievatelia: John F. Canny Ioannis Z. Emiris The Pennsylvania State University CiteSeerX Archives

Zdroj: ftp://ftp-sop.inria.fr/saga/emiris/publis/CEjacm.ps.gz

Predmety: Categories and Subject Descriptors, I.1.2 Algorithms (Algebraic algorithms, Analysis of algorithms). F.2.1 Numerical Algorithms and Problems (Computations on matrices, Computations on polynomials). F.2.2 Nonnumerical Algorithms and Problems (Computations on discrete s, Geometrical problems and computations) General Terms, Algorithms, Theory. Additional Key Words and Phrases, Sparse elimination theory, multivariate resultant, Newton polytope, mixed volume, polyhedral subdivision, eoeective Nullstellensatz, asymptotic complexity

Popis súboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.4733

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.4733

Extremal properties of three-dimensional sensor networks with applications

Autori: Ravelomanana, Vlady Laboratoire d'Informatique de Paris-Nord (LIPN) Université Paris 13 (UP13)-Institut Galilée-Université Sorbonne Paris Cité (USPC)-Centre National de la Recherche Scientifique (CNRS)

Prispievatelia: Ravelomanana, Vlady Laboratoire d'Informatique de Paris-Nord (LIPN) Université Paris 13 (UP13)-Institut Galilée-Université Sorbonne Paris Cité (USPC)-Centre National de la Recherche Scientifique (CNRS)

Zdroj: IEEE Transactions on Mobile Computing. 3:246-257

Predmety: G.3 Probability and statistics, FOS: Computer and information sciences, Sensor networks, topology control, Discrete Mathematics (cs.DM), [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], coverage, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], energy consumption, minimum/maximum degrees, Computer Science - Data Structures and Algorithms, transmitting/sensing ranges, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), F.2.2 Nonnumerical algorithms and problems, [INFO.INFO-DC]Computer Science [cs]/Distributed, ACM classification: C.2.1 Network architecture and design, Parallel, analytical methods, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], and Cluster Computing [cs.DC], hop-diameter, Computer Science - Distributed, Parallel, and Cluster Computing, connectivity, ad hoc networks, Distributed, Parallel, and Cluster Computing (cs.DC), Computer Science - Discrete Mathematics

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/pdf/cs/0411027
http://arxiv.org/abs/cs/0411027
https://dl.acm.org/doi/10.5555/2212317.2212332
http://ieeexplore.ieee.org/document/1318594/
http://ui.adsabs.harvard.edu/abs/2004cs.......11027R/abstract
https://www.computer.org/csdl/trans/tm/2004/03/h0246.html
https://dblp.uni-trier.de/db/journals/tmc/tmc3.html#Ravelomanana04
http://ieeexplore.ieee.org/iel5/7755/29217/01318594.pdf
https://doi.org/10.1109/TMC.2004.23
https://hal.science/hal-00003248v1
https://hal.science/hal-00003248v1/document

Categories and Subject Descriptors [F.2.2]: Nonnumerical Algorithms and Problems General Terms Algorithms, Theory

Prispievatelia: The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.nada.kth.se/~johanh/jh2csp.ps.

Popis súboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.4654; http://www.nada.kth.se/~johanh/jh2csp.ps

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.4654
http://www.nada.kth.se/~johanh/jh2csp.ps

Algorithms for computing approximate repetitions in musical sequences

Autori: Emilios Cambouropoulos Maxime Crochemore Costas S. Iliopoulos a ďalší

Prispievatelia: Emilios Cambouropoulos Maxime Crochemore Costas S. Iliopoulos a ďalší

Zdroj: http://www.dcs.kcl.ac.uk/staff/csi/publications/CCI99ApproxRepetitionsMusic.ps.

Predmety: String algorithms, approximate string matching, dynamic programming, computer-assisted music analysis. C.R. Categories, G.2.1 Combinatorics, F.2.2 Nonnumerical Algorithms and Problems

Popis súboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.4061; http://www.dcs.kcl.ac.uk/staff/csi/publications/CCI99ApproxRepetitionsMusic.ps

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.4061
http://www.dcs.kcl.ac.uk/staff/csi/publications/CCI99ApproxRepetitionsMusic.ps

Le rôle de la dimension dans la recherche de chemins optimaux dans les petits mondes

Autori: Giakkoupis, George Schabanel, Nicolas Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA) a ďalší

Prispievatelia: Giakkoupis, George Schabanel, Nicolas Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA) a ďalší

Zdroj: 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel)
https://hal.science/hal-00587955
13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France. 4 p

Predmety: small worlds, social networks, peer-to-peer networks, decentralized search, optimal paths, \category{F.2.2}{Nonnumerical Algorithms and Problems}{Routing and layout} \category{E.1}{Data Structures}{Graphs and networks} \category{G.2.2}{Graph Theory}{Graph algorithms, Network problems} \category{C.2.2}{Network Protocols}{Routing protocols}, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, [INFO.INFO-IR]Computer Science [cs]/Information Retrieval [cs.IR], [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [SHS.SOCIO]Humanities and Social Sciences/Sociology

Geografické téma: Cap Estérel, France

Dostupnosť: https://hal.science/hal-00587955
https://hal.science/hal-00587955v1/document
https://hal.science/hal-00587955v1/file/2011.02.11-SW.pdf

Computing MEMs and Relatives on Repetitive Text Collections.

Autori: Navarro, Gonzalo

Zdroj: ACM Transactions on Algorithms; Jan2025, Vol. 21 Issue 1, p1-33, 33p

Predmety: CODING theory, DATA structures, INFORMATION theory, DATA warehousing, COMPRESSIBILITY