Results 171 to 180 of about 5,032 (199)
Some of the next articles are maybe not open access.
L-infinity interdistance selection by parametric search
Information Processing Letters, 1989The selection problem asks for the kth largest or smallest element in a set S. In general, selection takes linear time, but if the set is constrained so that some relations between elements are known, sublinear- time selection is sometimes possible. We present an algorithm that selects the kth largest or smallest element from a Cartesian sum in O(n log
openaire +1 more source
Parametric search: three new applications
Frontiers of Mathematics in China, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Katoh, Naoki +3 more
openaire +2 more sources
Parametric tabu-search for mixed integer programs
Computers & Operations Research, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Segmentation of range images as the search for geometric parametric models
International Journal of Computer Vision, 1995Segmentation of range images has long been considered in computer vision as an important but extremely difficult problem. In this paper we present a new paradigm for the segmentation of range images into piecewise continuous surfaces. Data aggregation is performed via model recovery in terms of variable-order bi-variate polynomials using iterative ...
Ales Leonardis +2 more
openaire +1 more source
Interdistance Selection by Parametric Search
1987The selection problem asks for the k"' largest or smallest element in a set S. In general, selection takes linear time, but if the set is constrained so that sotne relations between elements are known, sublinear time selection is sometimes possible.
openaire +1 more source
Parametric sonars in searching of buried objects
The Journal of the Acoustical Society of America, 2008The subject of this paper is the description of usage of the parametric sonar for searching of the objects that are on the surface of the seabed or very close to it. Searching of underwater objects, especially these ones buried in the seabed has a very practical meaning.
openaire +1 more source
Visual search analysis using parametric fixations
Multimedia Tools and Applications, 2022Mohsina Ishrat, Pawanesh Abrol
openaire +1 more source
Parametric search and locating supply centers in trees
2005Linear-time and -space algorithms are presented for solving three versions of the p-center problem in a tree. The techniques are an application of parametric search.
openaire +1 more source
Real time scheduling with a budget: Parametric-search is better than binary search
Information Processing Letters, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Fractional Packing and Parametric Search Frameworks
2016The following chapter introduces three generic frameworks that will be used throughout this thesis. On the one hand, the focus will be set on the parametric search framework due to Megiddo (1979, 1983), which can often be used to solve parametric variants of known combinatorial problems in strongly polynomial time. On the other hand, we will review the
openaire +1 more source

