The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
It is known that the maximum hidden vertex set problem on a given simple polygon is NP-hard (Shermer, 1989), therefore we focused on the development of approximation algorithms to tackle it. We propose four strategies to solve this problem, the first two (based on greedy constructive search) are designed specifically to solve it, and the other two are based on the general metaheuristics simulated...
We propose a novel algorithm, referred to as enhanced bounded correlation (EBC), that significantly reduces the number of computations required to carry out template matching based on normalized cross correlation (NCC) and yields exactly the same result as the full search algorithm. The algorithm relies on the concept of bounding the matching function: finding an efficiently computable upper bound...
This paper suggests a signal processing method for finding the minimax codes which minimize the maximum redundancies over a class of sources with either a discrete or a continuous alphabet, and where relative entropy (cross entropy; discrimination information) is a criterion to measure the redundancy. A complexity analysis and numerical studies demonstrate the efficiency of the method.
The problem of scheduling a set of n jobs on m identical machines so as to minimize the makespan time is perhaps the most well-studied problem in the theory of approximation algorithms for NP-hard optimization problems. In this paper we present the strongest possible type of result for this problem, a polynomial approximation scheme. More precisely, for each ε, we give an algorithm that runs in time...
In this paper we study a class of resource tradeoffs that arise in such problems as parallel sorting algorithms, linear recursion schemata, VLSI layouts, and searching problems. The tradeoffs can all be traced to the common structure of a multiway tree, and the special class of binomial trees (which are isomorphic to the binomial coefficients) correspond to particularly efficient algorithms. Although...
When selecting from, or sorting, a file stored on a read-only tape and the internal storage is rather limited, several passes of the input tape may be required. We study the relation between the amount of internal storage available and the number of passes required to select the Kth highest of N inputs. We show, for example, that to find the median in two passes requires at least Ω(N1/2) and at most...
In parallel computation two approaches are common; namely unbounded parallelism and bounded parallelism. In this paper both approaches will be considered. The problem of unbounded parallelism is studied in section II and some lower and upper bounds on different connectivity problems for directed and undirected graphs are presented. In section III we mention bounded parallelism and three different...
In this paper we consider polynomial-time algorithms for bin packing and their applications. The previously studied FIRST FIT and BEST FIT algorithms are shown to be special cases of a more generalized class of algorithms which all have similar worst case behavior. Linear time algorithms are then introduced which, though "faster" than FIRST FIT and BEST FIT, have the same, or better, worst...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.