Výsledky vyhledávání - ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems

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

Autoři: Antunes, Daniel Mathieu, Claire Mustafa, Nabil a další

Přispěvatelé: Antunes, Daniel Mathieu, Claire Mustafa, Nabil a další

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⟩

Témata: 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

Dostupnost: 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

Longest Common Substring with Approximately k Mismatches

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: 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⟩

Témata: 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

Dostupnost: 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

Total space in resolution is at least width squared

Autoři: Bonacina, I.

Zdroj: Leibniz International Proceedings in Informatics, LIPIcs.

Témata: Resolution, Total space, Width, Automata theory, Optical resolving power, Trees (mathematics), Complexity measures, Complexity of proof procedures, K-CNF formulas, Nonnumerical algorithms and problems, Resolution refutation, Subject classification, Computational complexity

Popis souboru: print

Přístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-207493

Versioning Tree Structures by Path-Merging.

Autoři: Mohamed, Khaireel A. Langner, Tobias Ottmann, Thomas

Zdroj: Frontiers in Algorithmics (9783540693109); 2008, p101-112, 12p

ABSTRACTS from other ACM Publications.

Zdroj: Communications of the ACM; Jan1982, Vol. 25 Issue 1, p69-72, 4p

Témata: PERIODICALS, COMPUTER programming, INFORMATION technology, ALGORITHMS

ABSTRACTS from other ACM Publications.

Zdroj: Communications of the ACM; Jul1982, Vol. 25 Issue 7, p487-492, 6p

Témata: SEQUENTIAL machine theory, REDUCED instruction set computers, MICROELECTRONICS, INTEGRATED circuits

Reviews & Products: COMMUNICATIONS of the ACM (Periodical)

Linear-Time Approximation Schemes for Clustering Problems in Any Dimensions.

Autoři: KUMAR, AMIT SABHARWAL, YOGISH SEN, SANDEEP

Zdroj: Journal of the ACM; Jan2010, Vol. 57 Issue 2, p5-5:32, 32p, 1 Diagram, 6 Charts, 1 Graph

Témata: ALGORITHMS, PROBABILITY theory, MATHEMATICS, GEOMETRIC probabilities, LINEAR systems, LINEAR time invariant systems, CLUSTER analysis (Statistics)

The Effectiveness of Lloyd-Type Methods for the k-Means Problem.

Autoři: OSTROVSKY, RAFAIL RABANI, YUVAL SCHULMAN, LEONARD J. a další

Zdroj: Journal of the ACM; Dec2012, Vol. 59 Issue 6, p28-22, 22p

Témata: ALGORITHMS, APPROXIMATION algorithms, HEURISTIC algorithms, ALGEBRA, MATHEMATICAL optimization, ITERATIVE methods (Mathematics)

ABSTRACTS from other ACM Publications.

Zdroj: Communications of the ACM; Oct82, Vol. 25 Issue 10, p748-753, 6p

Témata: DATA compression, CODING theory, DATABASE management, COMPUTER industry, COMPUTER programming

The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side.

Autoři: Grohe, Martin

Zdroj: Journal of the ACM; Mar2007, Vol. 54 Issue 1, p1-24, 24p, 2 Illustrations

Témata: HOMOMORPHISMS, CONSTRAINT satisfaction, MATHEMATICS, ARTIFICIAL intelligence, MATHEMATICAL functions

ABSTRACTS from other ACM Publications.

Zdroj: Communications of the ACM; Apr1982, Vol. 25 Issue 4, p286-291, 6p

Témata: AUTOMATIC theorem proving, SPANNING trees, TREE graphs, PROOF theory

Dynamic Ordered Sets with Exponential Search Trees.

Autoři: Andersson, Arne Thorup, Mikkel

Zdroj: Journal of the ACM; Jun2007, Vol. 54 Issue 3, p1-40, 40p, 1 Illustration, 3 Diagrams

Témata: DATA structures, EXPONENTIAL functions, ALGORITHMS, SET theory, INFORMATION retrieval, VECTOR spaces

On Computing All Abductive Explanations from a Propositional Horn Theory.

Autoři: Eiter, Thomas Makino, Kazuhisa

Zdroj: Journal of the ACM; Oct2007, Vol. 54 Issue 5, p1-54, 54p, 3 Charts

Témata: ALGORITHMS, MONOTONE operators, POLYNOMIALS, ALGEBRA, COMPUTER logic, MATHEMATICAL logic

Approximating the Partition Function of the Ferromagnetic Potts Model.

Autoři: GOLDBERG, LESLIE ANN JERRUM, MARK

Zdroj: Journal of the ACM; Oct2012, Vol. 59 Issue 5, p25-31, 31p

Témata: PARTITION functions, PARALLEL algorithms, FERROMAGNETIC materials, PROBABILITY theory, DISTRIBUTION (Probability theory), APPROXIMATION theory

ABSTRACTS from other ACM Publications.

Zdroj: Communications of the ACM; Dec1982, Vol. 25 Issue 12, p940-942, 3p

Témata: DATABASES, MATHEMATICAL models, COMPUTER systems

Korporace: ASSOCIATION for Computing Machinery

Discrete Temporal Constraint Satisfaction Problems.

Autoři: Bodirsky, Manuel Martin, Barnaby Mottet, Antoine

Zdroj: Journal of the ACM; Jan2018, Vol. 65 Issue 2, p1-41, 41p

Témata: ENDOMORPHISMS, GENETIC polymorphisms, INTEGERS, COMPUTATIONAL complexity, ELECTRONIC data processing

Geometric Suffix Tree: Indexing Protein 3-D Structures.

Autoři: SHIBUYA, TETSUO

Zdroj: Journal of the ACM; Mar2010, Vol. 57 Issue 3, p15:1-15:17, 17p, 2 Diagrams, 3 Charts

Témata: PROTEIN structure, THREE-dimensional imaging in biology, MOLECULAR biology, CRYSTALLOGRAPHY software, STANDARD deviations, DATA structures, COMPUTER network resources

Online Geometric Reconstruction.

Zdroj: Journal of the ACM; Jul2011, Vol. 58 Issue 4, p14:1-14:32, 32p

Témata: ALGORITHMS, QUERYING (Computer science), DATABASE searching, CONVEX domains, COMPUTATIONAL complexity, GEOMETRY

Boosting Textual Compression in Optimal Linear Time.

Autoři: Ferragina, Paolo Giancarlo, Raffaele Manzini, Giovanni a další

Zdroj: Journal of the ACM; Jul2005, Vol. 52 Issue 4, p688-713, 26p, 2 Diagrams

Témata: ALGORITHMS, DATA structures, ELECTRONIC data processing, COMPUTER operating systems, INFORMATION theory

Compressing and Indexing Labeled Trees, with Applications.

Autoři: FERRAGINA, PAOLO LUCCIO, FABRIZIO MANZINI, GIOVANNI a další

Zdroj: Journal of the ACM; Nov2009, Vol. 57 Issue 1, p4-4:33, 33p, 2 Diagrams, 18 Charts

Témata: XML (Extensible Markup Language), ERGODIC theory, DOCUMENT markup languages, WEB development, DOCUMENT type definitions, WEBSITES, COMPUTER science research