Results 21 to 30 of about 73,753 (309)
Polynomial Time Algorithms for Bichromatic Problems [PDF]
, 2017 In this article, we consider a collection of geometric problems involving points colored by two colors (red and blue), referred to as bichromatic problems. The motivation behind studying these problems is two fold; (i) these problems appear naturally and frequently in the fields like Machine learning, Data mining, and so on, and (ii) we are interested ...
Sayan Bandyapadhyay, Aritra Banik
openaire +2 more sources
IEEE Access, 2020 In the context of chaotic secure communication, this paper is concerned with the predefined-time polynomial-function-based synchronization of chaotic systems via sliding mode control.
Qiaoping Li, Chao Yue
doaj +1 more source
Journal of Mathematical Cryptology, 2022 We investigate the problem of recovering integer inputs (up to an affine scaling) when given only the integer monotonic polynomial outputs. Given nn integer outputs of a degree-dd integer monotonic polynomial whose coefficients and inputs are integers ...
Vivek Srinivas +2 more
doaj +1 more source
A Batching Machine Model for Lot Scheduling on a Single Machine
Foundations of Computing and Decision Sciences, 2018 A recently introduced lot scheduling problem is considered. It is to find a partition of jobs of n orders into lots and to sequence these lots on a single machine so that the total average completion time of the orders is minimized.
Kovalyov Mikhail Y.
doaj +1 more source
Detrended fluctuation analysis based on best-fit polynomial
Frontiers in Environmental Science, 2022 Detrended fluctuation analysis (DFA) can quantify long-range correlation (LRC) and fractal scaling behavior of signal. We compared the results of variant DFA methods by varying the order of the polynomial and found that the order of 6 was relatively ...
Shanshan Zhao +5 more
doaj +1 more source
A Polynomial-Time Algorithm for Pliable Index Coding [PDF]
IEEE Transactions on Information Theory, 2016 In pliable index coding, we consider a server with $m$ messages and $n$ clients where each client has as side information a subset of the messages. We seek to minimize the number of broadcast transmissions, so that each client can recover any one unknown message she does not already have. Previous work has shown that the pliable index coding problem is
Linqi Song, Christina Fragouli
openaire +2 more sources
Polynomial-time algorithms for minimum energy scheduling [PDF]
ACM Transactions on Algorithms, 2007 The aim of power management policies is to reduce the amount of energy consumed by computer systems while maintaining a satisfactory level of performance. One common method for saving energy is to simply suspend the system during idle times. No energy is consumed in the suspend mode.
Baptiste, Philippe +2 more
openaire +5 more sources
The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 For some time the discrete strategy improvement algorithm due to Jurdzinski and Voge had been considered as a candidate for solving parity games in polynomial time.
Felix Canavoi +2 more
doaj +1 more source
Graph Operations and Neighborhood Polynomials
Discussiones Mathematicae Graph Theory, 2021 The neighborhood polynomial of graph G is the generating function for the number of vertex subsets of G of which the vertices have a common neighbor in G.
Alipour Maryam, Tittmann Peter
doaj +1 more source
A polynomial-time algorithm for global value numbering [PDF]
Science of Computer Programming, 2004 AbstractWe describe a polynomial-time algorithm for global value numbering, which is the problem of discovering equivalences among program sub-expressions. We treat all conditionals as non-deterministic and all program operators as uninterpreted. We show that there are programs for which the set of all equivalences contains terms whose value graph ...
Sumit Gulwani, George C. Necula
openaire +1 more source