We show that n lines in 3-space can be cut into O(n2-1/69 log16/69 n) pieces, such that all depth cycles defined by triples of lines are eliminated. This partially resolves a long...
Abstract. A scheduling algorithm for satellites imaging tasks in a dynamic and uncertain environment. The environment is dynamic in the sense that imaging tasks will be added or re...
Abstract: We introduce the snowblower problem (SBP), a new optimization problem that is closely related to milling problems and to some material-handling problems. The objective in...
Esther M. Arkin, Michael A. Bender, Joseph S. B. M...
— Projection methods have been used in the analysis of bi-tonal document images for different tasks like page segmentation and skew correction for over two decades. However, thes...
— A new algorithm is proposed to reduce the number of intermediate registers of a pipelined circuit using a combination of multi-clock cycle paths and clock scheduling. The algor...