Results 241 to 250 of about 70,225 (278)
Some of the next articles are maybe not open access.
Approximate parametric searching
Information Processing Letters, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Parametrized Fibonacci search method with k-Lucas numbers
Applied Mathematics and Computation, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
DEMİR, ALİ +2 more
openaire +3 more sources
Face image searching by parametric statistical features
2016 13th International Conference on Modern Problems of Radio Engineering, Telecommunications and Computer Science (TCSET), 2016The method for face parametrical statistical features extraction from intensity fragments and segments is considered. Pixel coordinates means are calculated. Some results of face searching for different features are presented.
Roman Melnyk, Yuriy Kalychak
openaire +1 more source
Global parametric search and left ventricular identification
Annals of Biomedical Engineering, 1981A mathematical model of left ventricular (LV) function in the dog has been developed. Based on a time-varying systolic elastance, the fitting procedure combined a local search according to a second-order method with a global heuristic search and provided beat-to-beat uncertainty intervals for each of the model parameters.
Guy Demoment, Jacques Hinglais
openaire +1 more source
Automated parametrization of custom search ranking functions
2010 International Conference on Electronics and Information Engineering, 2010The search for information is a task most commonly performed by web search engines. A common problem in web search is the personalization of search results. Personalization is essentially a customization of the results ranking formula. This paper focuses on the automation of the ranking formula according to the user's preferences.
Sandi Pohorec +3 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
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
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
Parametric tabu-search for mixed integer programs
Computers & Operations Research, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources