Results 1 to 10 of about 2,811,657 (82)
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]
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
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
Giuseppa CASTIGLIONE +2 more
exaly +2 more sources
Explicit Hopcroft's Trick in Categorical Partition Refinement [PDF]
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
Continuant Polynomials and Worst-Case Behavior of Hopcroft’s Minimization Algorithm
Olivier Carton, Luc Boasson
exaly +2 more sources
Hopcroft's Problem, Log-Star Shaving, 2D Fractional Cascading, and Decision Trees [PDF]
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
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
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
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

