Results 1 to 10 of about 2,811,657 (82)

Acoustic materials database processing in the cad system by the hopcroft-carp algorithm for comparison of bipartite graphs

open access: yesTrudy Odesskogo Politehničeskogo Universiteta, 2019
The development of industry has revealed the need for a wide variety of production facilities with special requirements for their acoustic characteristics.
Інна Сергіївна Сінько   +3 more
doaj   +6 more sources

Quantum Algorithms for Hopcroft's Problem [PDF]

open access: yesACM Transactions on Quantum Computing
In this work, we study quantum algorithms for Hopcroft’s problem which is a fundamental problem in computational geometry. Given n points and n lines in the plane, the task is to determine whether there is a point-line incidence. The classical complexity
Jevgēnijs Vihrovs, Aleksandrs Belovs
exaly   +2 more sources

On Extremal Cases of Hopcroft’s Algorithm

open access: yesLecture Notes in Computer Science, 2009
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft's algorithm. Hopcroft's algorithm has several degrees of freedom, so there can exist different sequences of refinements of the set of ...
Marinella Sciortino   +1 more
exaly   +2 more sources

Circular Sturmian Words and Hopcroft’s Algorithm

open access: yesTheoretical Computer Science, 2009
Giuseppa CASTIGLIONE   +2 more
exaly   +2 more sources

Explicit Hopcroft's Trick in Categorical Partition Refinement [PDF]

open access: yesInternational Workshop on Coalgebraic Methods in Computer Science, 2023
Algorithms for partition refinement are actively studied for a variety of systems, often with the optimisation called Hopcroft's trick. However, the low-level description of those algorithms in the literature often obscures the essence of Hopcroft's ...
Takahiro Sanada   +4 more
semanticscholar   +1 more source

Hopcroft's Problem, Log-Star Shaving, 2D Fractional Cascading, and Decision Trees [PDF]

open access: yesACM-SIAM Symposium on Discrete Algorithms, 2021
We revisit Hopcroft's problem and related fundamental problems about geometric range searching. Given $n$ points and $n$ lines in the plane, we show how to count the number of point-line incidence pairs or the number of point-above-line pairs in $O(n^{4 ...
T. Chan, Da-Wei Zheng
semanticscholar   +1 more source

Hopcroft’s Problem, Log* Shaving, Two-dimensional Fractional Cascading, and Decision Trees

open access: yesACM Trans. Algorithms, 2023
We revisit Hopcroft’s problem and related fundamental problems about geometric range searching. Given n points and n lines in the plane, we show how to count the number of point-line incidence pairs or the number of point-above-line pairs in O(n4/3) time,
Timothy M. Chan, Da-Wei Zheng
semanticscholar   +1 more source

An Efficient Algorithm for Decomposition of Partially Ordered Sets

open access: yesJournal of mathematics, 2023
Efficient time complexities for partial ordered sets or posets are well-researched field. Hopcroft and Karp introduced an algorithm that solves the minimal chain decomposition in O (n2.5) time. Felsner et al.
E. Badr   +3 more
semanticscholar   +1 more source

Crucian carp position and pose recognition based on an improved photo-model method

open access: yesJournal of Physics, Conference Series, 2022
This research aimed to solve the problem of fish position and pose recognition in the process of robot grasping fish. Crucian carp is the subject of this research and studies the position and pose recognition algorithm of crucian carp by photo-model ...
Changyi Wen   +3 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy