Results 1 to 10 of about 2,482,039 (287)
CTIDH: faster constant-time CSIDH
Transactions on Cryptographic Hardware and Embedded Systems, 2021 This paper introduces a new key space for CSIDH and a new algorithm for constant-time evaluation of the CSIDH group action. The key space is not useful with previous algorithms, and the algorithm is not useful with previous key spaces, but combining the ...
Gustavo Banegas +7 more
doaj +2 more sources
Constant-Time Algorithms for Sparsity Matroids [PDF]
International Colloquium on Automata, Languages and Programming, 2011 A graph G=(V, E) is called (k, l)-sparse if |F|≤k|V(F)|−l for any F⊆E with F≠∅. Here, V(F) denotes the set of vertices incident to F. A graph G=(V,E) is called (k,l)-full if G contains a (k,l)-sparse subgraph with |V| vertices and k|V|−l edges.
Hiro Ito +2 more
semanticscholar +3 more sources
Constant-Time Algorithms for Continuous Optimization Problems [PDF]
Sublinear Computation Paradigm, 2021 In this chapter, we consider constant-time algorithms for continuous optimization problems. Specifically, we consider quadratic function minimization and tensor decomposition, both of which have numerous applications in machine learning and data mining ...
Yuichi Yoshida
semanticscholar +2 more sources
Near-Constant-Time Distributed Algorithms on a Congested Clique [PDF]
International Symposium on Distributed Computing, 2014 This paper presents constant-time and near-constant-time distributed algorithms for a variety of problems in the congested clique model. We show how to compute a 3-ruling set in expected O(logloglogn) rounds and using this, we obtain a constant ...
James Hegeman +2 more
semanticscholar +4 more sources
Sublinear Computation Paradigm: Constant-Time Algorithms and Sublinear Progressive Algorithms
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2022 Hiro Itô
exaly +3 more sources
Sublinear Time Algorithms and Complexity of Approximate Maximum Matching [PDF]
Symposium on the Theory of Computing, 2022 Sublinear time algorithms for approximating maximum matching size have long been studied. Much of the progress over the last two decades on this problem has been on the algorithmic side.
Soheil Behnezhad +2 more
semanticscholar +1 more source
Adjacency Maps and Efficient Graph Algorithms
Algorithms, 2022 Graph algorithms that test adjacencies are usually implemented with an adjacency-matrix representation because the adjacency test takes constant time with adjacency matrices, but it takes linear time in the degree of the vertices with adjacency lists. In
Gabriel Valiente
doaj +1 more source
Energies, 2021 Maximum power point tracking (MPPT) algorithms are invariably employed to utilize solar photovoltaic (PV) systems effectively. Perturbation based MPPT algorithms are popular due to their simplicity and reasonable efficiency.
Sachin Angadi +3 more
doaj +1 more source
Provably constant-time planning and replanning for real-time grasping objects off a conveyor belt [PDF]
Robotics: Science and Systems Conference, 2020 In warehouse and manufacturing environments, manipulation platforms are frequently deployed at conveyor belts to perform pick-and-place tasks. Because objects on the conveyor belts are moving, robots have limited time to pick them up.
Fahad Islam +3 more
semanticscholar +1 more source
IEEE Access, 2020 For the shortest link scheduling (SLS), i.e., scheduling a given set of links with minimum time slots, we consider the distributed algorithm design by using the locality of the protocol model with high fidelity under the Rayleigh fading.
Kan Yu +3 more
doaj +1 more source