Výsledky vyhledávání - f.2 analysis of algorithms AND ((problem OR problemy) OR problems) complexity~

Cut Query Algorithms with Star Contraction

Autoři: Apers, Simon Efron, Yuval Gawrychowski, Pawel a další

Přispěvatelé: Apers, Simon Efron, Yuval Gawrychowski, Pawel a další

Zdroj: Apers, S, Efron, Y, Gawrychowski, P, Lee, T, Mukhopadhyay, S & Nanongkai, D 2022, Cut Query Algorithms with Star Contraction . in Proceedings-2022 IEEE 63rd Annual Symposium on Foundations of Computer Science, FOCS 2022 . IEEE Computer Society Press, Proceedings-Annual IEEE Symposium on Foundations of Computer Science, FOCS, vol. 2022-October, pp. 507-518, 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, Denver, United States, 31/10/2022 . https://doi.org/10.1109/FOCS54457.2022.00055

Témata: FOS: Computer and information sciences, Quantum Physics, F.2 Analysis of Algorithms and Problem Complexity, FOS: Physical sciences, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], F.1.3 Complexity Measures and Classes, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Computational Complexity, F.1.1 Models of Computation, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Quantum Physics (quant-ph)

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2201.05674
https://curis.ku.dk/ws/files/359081183/Fulltext.pdf
https://hal.science/hal-04239964v1/document
https://hal.science/hal-04239964v1
https://doi.org/10.1109/focs54457.2022.00055

Nearly Optimal Communication and Query Complexity of Bipartite Matching

Autoři: Blikstad, Joakim Van Den Brand, Jan Efron, Yuval a další

Zdroj: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS). :1174-1185

Témata: FOS: Computer and information sciences, Computer Science - Computational Complexity, F.1.1 Models of Computation, F.2 Analysis of Algorithms and Problem Complexity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), F.1.3 Complexity Measures and Classes, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2208.02526

Efficient assembly consensus algorithms for divergent contig sets

Autoři: Chateau, Annie Davot, Tom Lafond, Manuel

Přispěvatelé: Chateau, Annie Davot, Tom Lafond, Manuel

Zdroj: Computational Biology and Chemistry. 93:107516

Témata: 0301 basic medicine, 03 medical and health sciences, B.2.4.a Algorithms, F.2 Analysis of Algorithms and Problem Complexity, 0206 medical engineering, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], 02 engineering and technology, [INFO] Computer Science [cs], L.3.0.j. Molecular biology 3, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM]

Popis souboru: application/pdf

Přístupová URL adresa: https://hal-lirmm.ccsd.cnrs.fr/lirmm-03244191/file/main.pdf
https://pubmed.ncbi.nlm.nih.gov/34082320
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03244191v1/document
https://doi.org/10.1016/j.compbiolchem.2021.107516
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03244191v1
https://europepmc.org/article/MED/34082320
https://doi.org/10.1016/j.compbiolchem.2021.107516
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03244191/document
https://pubmed.ncbi.nlm.nih.gov/34082320/
https://www.sciencedirect.com/science/article/abs/pii/S1476927121000839
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03244191

A Distributed Information Divergence Estimation over Data Streams

Autoři: Anceaume, Emmanuelle Busnel, Yann CIDER a další

Přispěvatelé: Anceaume, Emmanuelle Busnel, Yann CIDER a další

Zdroj: IEEE Transactions on Parallel and Distributed Systems. 25:478-487

Témata: [INFO.INFO-DC]Computer Science [cs]/Distributed, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 02 engineering and technology, E.0.a Data communications aspects < E.0 General < E Data, Parallel, Divergence, and Cluster Computing [cs.DC], Data stream, Randomized approximation algorithm, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, F.2.1 Numerical Algorithms and Problems < F.2 Analysis of Algorithms and Problem Complexity < F Theory of Computation

Popis souboru: application/pdf

Přístupová URL adresa: https://hal.archives-ouvertes.fr/hal-00998708/file/ankle-tpds2013.pdf
https://hal.science/hal-00998708v1/document
https://hal.science/hal-00998708v1
https://doi.org/10.1109/tpds.2013.101
https://dblp.uni-trier.de/db/journals/tpds/tpds25.html#AnceaumeB14
https://hal.archives-ouvertes.fr/hal-00998708
https://ieeexplore.ieee.org/document/6494567
https://hal.inria.fr/hal-00804437
https://hal.archives-ouvertes.fr/hal-00998708/document
http://dblp.uni-trier.de/db/journals/tpds/tpds25.html#AnceaumeB14

Efficient type inference for secure information flow

Autoři: Katia Hristova Tom Rothamel Yanhong A. Liu a další

Přispěvatelé: Katia Hristova Tom Rothamel Yanhong A. Liu a další

Zdroj: http://rothamel.us/papers/hristova-plas06.pdf.

Témata: Categories and Subject Descriptors D.4.6 [Operating Systems, Security and Protection—information flow controls, D.4.6 [Oper- ating Systems, Security and Protection—access controls, D.3.4 [Programming Languages, Language Classifications—constraint and logic languages, D.3 [Programming Languages, Processors— code generation, optimization, E.1 [Data, Data Structures— arrays, lists, queues, records, F.2 [Analysis of Algorithms and Problems Complexity, Nonnumerical Algorithms and Problems— computations on discrete structures, I.2.2 [Artificial Intelligence, Automatic Programming—Program transformation, E.2 [Data, Data Storage Representations—linked representations General Terms security, algorithms, languages, performance Keywords information flow, type inference, security, algorithm, time

Popis souboru: application/pdf

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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.571.5580
http://rothamel.us/papers/hristova-plas06.pdf

Computation of Market Equilibria via the Excess Demand Function

Autoři: Codenotti B. Mc Cune B. Pemmaraju S. a další

Témata: F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, computation of equilibria, algorithms

Přístupová URL adresa: https://publications.cnr.it/doc/156800
http://www.cnr.it/prodotto/i/156800

Abstract Efficient Trust Management Policy Analysis from Rules ∗

Přispěvatelé: The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.sunysb.edu/~katia/HriTekLiu07.pdf.

Témata: lists, queues, records, F.2 [Analysis of Algorithms and Problems Complexity, Nonnumerical Algorithms and Problems— computations on discrete structures, I.2.2 [Artificial Intelligence, Automatic Programming—Program transformation General Terms security, algorithms, languages, performance Keywords access control, policy analysis, security, algorithm, time

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.9016; http://www.cs.sunysb.edu/~katia/HriTekLiu07.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.9016
http://www.cs.sunysb.edu/~katia/HriTekLiu07.pdf

Communication and Streaming Complexity of Approximate Pattern Matching

Autoři: Starikovskaya, Tatiana Département d'informatique - ENS Paris (DI-ENS) École normale supérieure - Paris (ENS-PSL) a další

Přispěvatelé: Starikovskaya, Tatiana Département d'informatique - ENS Paris (DI-ENS) École normale supérieure - Paris (ENS-PSL) a další

Zdroj: 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)
https://hal.science/hal-03942927
28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 2017, Warsaw, Poland. ⟨10.4230/LIPIcs.CPM.2017.13⟩

Témata: 1998 ACM Subject Classification F.2 Analysis of Algorithms and Problem Complexity phrases approximate pattern matching edit distance randomised algorithms streaming algorithms communication complexity, 1998 ACM Subject Classification F.2 Analysis of Algorithms and Problem Complexity phrases approximate pattern matching, edit distance, randomised algorithms, streaming algorithms, communication complexity, [INFO]Computer Science [cs]

Geografické téma: Warsaw, Poland

Relation: hal-03942927; https://hal.science/hal-03942927; https://hal.science/hal-03942927/document; https://hal.science/hal-03942927/file/LIPIcs-CPM-2017-13.pdf

Dostupnost: https://hal.science/hal-03942927
https://hal.science/hal-03942927/document
https://hal.science/hal-03942927/file/LIPIcs-CPM-2017-13.pdf
https://doi.org/10.4230/LIPIcs.CPM.2017.13

An efficient algorithm for image segmentation, Markov random fields and related problems

Autoři: Dorit S. Hochbaum The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Dorit S. Hochbaum The Pennsylvania State University CiteSeerX Archives

Zdroj: http://riot.ieor.berkeley.edu/~dorit/pub/MRF.pdf.

Témata: Categories and Subject Descriptors, F.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems, G.1.6 [Numerical Analysis, Optimiza

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.366.608; http://riot.ieor.berkeley.edu/~dorit/pub/MRF.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.366.608
http://riot.ieor.berkeley.edu/~dorit/pub/MRF.pdf

Skewed allocation of non-uniform data for broadcasting over multiple channels

Autoři: BERTOSSI, ALAN ALBERT M. C. Pinotti

Zdroj: 20th IEEE International Parallel and Distributed Processing Symposium. IPDPS, Rodi, Grecia, 25-29 Aprile 2006
info:cnr-pdr/source/autori:Bertossi A. A., Pinotti M. C./congresso_nome:20th IEEE International Parallel and Distributed Processing Symposium. IPDPS/congresso_luogo:Rodi, Grecia/congresso_data:25-29 Aprile 2006/anno:2006/pagina_da:/pagina_a:/intervallo_pagine

Témata: WIRELESS NETWORKS, DATA BROADCASTING, SKEWED ALLOCATION, FLAT SCHEDULING, F.2 Analysis of Algorithms and Problem Complexity, Wireless communication, wireless sensor networks

Přístupová URL adresa: http://www.cecs.uci.edu/~papers/ipdps06/pdfs/1568974423-IPDPS-paper-1.pdf
http://www.cnr.it/prodotto/i/91365
https://publications.cnr.it/doc/91365
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000001639355
https://hdl.handle.net/11585/28967
https://openportal.isti.cnr.it/doc?id=people______::6a39831bfc56b01b4f86fd0b9496c60e

Genetic algorithms for problems of logical data analysis in discrete optimization and image recognition.

Autoři: Sotnezov, R.

Zdroj: Pattern Recognition & Image Analysis; Sep2009, Vol. 19 Issue 3, p469-477, 9p

Algorithms for distributed functional monitoring

Autoři: Graham Cormode S. Muthukrishnan Ke Yi a další

Přispěvatelé: Graham Cormode S. Muthukrishnan Ke Yi a další

Zdroj: http://www.research.att.com/people/Cormode_Graham/library/publications/CormodeMuthukrishnanYi11.pdf.

Témata: Categories and Subject Descriptors, F.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems General Terms, Algorithms, theory Additional Key Words and Phrases, Distributed computing, functional monitoring

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.229.829; http://www.research.att.com/people/Cormode_Graham/library/publications/CormodeMuthukrishnanYi11.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.229.829
http://www.research.att.com/people/Cormode_Graham/library/publications/CormodeMuthukrishnanYi11.pdf

The complexity of evaluating tuple generating dependencies

Autoři: Reinhard Pichler Sebastian Skritek The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Reinhard Pichler Sebastian Skritek The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.edbt.org/Proceedings/2011-Uppsala/papers/icdt/a23-pichler.pdf.

Témata: Categories and Subject Descriptors H.2.4 [Database Management, Systems—Relational databases, H.2.5 [Database Management, Heterogeneous Databases—Data translation, F.2 [Analysis of Algorithms and Problem Complexity, Miscellaneous

Popis souboru: application/pdf

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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.429.655
http://www.edbt.org/Proceedings/2011-Uppsala/papers/icdt/a23-pichler.pdf

An evolutionary algorithm to generate hyper-ellipsoid detectors for negative selection

Autoři: Joseph M. Shapiro The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Joseph M. Shapiro The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.bham.ac.uk/~wbl/biblio/gecco2005/docs/p337.pdf.

Témata: Categories and Subject Descriptors F.2 [Analysis of Algorithms and Problem Complexity, Miscellaneous, E.1 [DataStructures, Trees General Terms Algorithms Keywords Evolutionary computation, artificial immune systems, computational geometry, negative

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134.3; http://www.cs.bham.ac.uk/~wbl/biblio/gecco2005/docs/p337.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134.3
http://www.cs.bham.ac.uk/~wbl/biblio/gecco2005/docs/p337.pdf

Secure Multiparty Computation of Approximations.

Autoři: Feigenbaum, Joan Ishai, Yuval Malkin, Tal a další

Zdroj: ACM Transactions on Algorithms; 2006, Vol. 2 Issue 3, p435-472, 38p

Témata: ALGORITHMS, MATHEMATICAL analysis, APPROXIMATION theory, FUNCTIONAL analysis, MATHEMATICS, ALGEBRA

Matching Algorithmic Bounds for Finding a Brouwer Fixed Point.

Autoři: XI CHEN XIAOTIE DENG

Zdroj: Journal of the ACM; Jul2008, Vol. 55 Issue 3, p1-26, 26p, 1 Diagram, 8 Charts

Témata: BOUNDARY value problems, ALGORITHMS, NONLINEAR boundary value problems, INITIAL value problems, COMPLEX variables, MATHEMATICAL physics, FIXED point theory, NONLINEAR operators

Fast and Accurate Visibility Preprocessing

Autoři: Nirenstein, Shaun

Témata: I.3 COMPUTER GRAPHICS, F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, G.4 MATHEMATICAL SOFTWARE

Popis souboru: pdf http://pubs.cs.uct.ac.za/archive/00000101/01/thesis.pdf

Dostupnost: http://pubs.cs.uct.ac.za/archive/00000101/

On Aligning Non-Order-Associated Binary Decision Diagrams.

Autoři: Bochkarev, Alexey A. Smith, J. Cole

Zdroj: INFORMS Journal on Computing; Sep/Oct2023, Vol. 35 Issue 5, p910-928, 19p

Témata: COMBINATORIAL optimization

Korporace: UNITED States. Office of Naval Research

On Solving MAX-SAT Using Sum of Squares.

Autoři: Sinjorgo, Lennart Sotirov, Renata

Zdroj: INFORMS Journal on Computing; Mar/Apr2024, Vol. 36 Issue 2, p417-433, 17p

Témata: SUM of squares, SEMIDEFINITE programming

Tossing Coins with an -Machine.

Autoři: Daylight, Edgar Graham

Zdroj: Symmetry (20738994); Oct2025, Vol. 17 Issue 10, p1745, 66p

Témata: COMPUTATIONAL complexity, TURING machines, CONSTRAINT satisfaction, NP-complete problems, ALGORITHMS, HYPOTHESIS