Search Results - "ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems"

  • Showing 1 - 4 results of 4
Refine Results
  1. 1

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

    Authors: Antunes, Daniel Mathieu, Claire Mustafa, Nabil et al.

    Contributors: Antunes, Daniel Mathieu, Claire Mustafa, Nabil et al.

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

    Subject Terms: 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

    Subject Geographic: Vienna, Austria

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

    View record from BASE Nájsť tento článok vo Web of Science
    Save to List
  2. 2

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

    Authors: Antunes, Daniel Mathieu, Claire Mustafa, Nabil et al.

    Contributors: Antunes, Daniel Mathieu, Claire Mustafa, Nabil et al.

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

    Subject Terms: 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

    Subject Geographic: Vienna, Austria

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

    View record from BASE Nájsť tento článok vo Web of Science
    Save to List
  3. 3

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

    Authors: Antunes, Daniel Mathieu, Claire Mustafa, Nabil et al.

    Contributors: Antunes, Daniel Mathieu, Claire Mustafa, Nabil et al.

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

    Subject Terms: 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

    Subject Geographic: Vienna, Austria

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

    View record from BASE Nájsť tento článok vo Web of Science
    Save to List
  4. 4

    Longest Common Substring with Approximately k Mismatches

    Authors: Starikovskaya, Tatiana Département d'informatique - ENS Paris (DI-ENS) École normale supérieure - Paris (ENS-PSL) et al.

    Contributors: Starikovskaya, Tatiana Département d'informatique - ENS Paris (DI-ENS) École normale supérieure - Paris (ENS-PSL) et al.

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

    Subject Terms: 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]

    Subject Geographic: 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

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

    View record from BASE Nájsť tento článok vo Web of Science
    Save to List

Search Tools: