Results 231 to 240 of about 86,954 (260)
Some of the next articles are maybe not open access.
Parametric Bandits for Search Engine Marketing Optimisation
2022Expense optimisation for online marketing is a relevant and challenging task. In particular, the problem of splitting daily budget among campaigns, together with the problem of setting bids for the auctions that regulate ad appearance, have been recently cast as a multi-armed bandit problem. However, at the current state of the art several shortcomings
Gigli, M, Stella, F
openaire +1 more source
On Nonlinear Parametric Search
Algorithmica, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Approximate parametric searching
Information Processing Letters, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
In search of a perceptual basis for interacting with parametric images
Proceedings of the seventh ACM conference on Creativity and cognition, 2009Many people appreciate the aesthetics of fractal images, but few are inclined to engage in the mathematics needed to create them. Finding a perceptual basis for interacting with parametric images like fractals could make the parameter space more accessible, which is an important step towards democratizing this creative activity. This paper discusses an
Daryl H. Hepting +2 more
openaire +1 more source
Parametrized Fibonacci search method with k-Lucas numbers
Applied Mathematics and Computation, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ali Demir +2 more
openaire +3 more sources
A Parametric Architecture for Tags Clustering in Folksonomic Search Engines
2009 Ninth International Conference on Intelligent Systems Design and Applications, 2009Semantic search engines rely on the existence of a rich set of semantic connections between the concepts associated to documents and those used for the queries. With folksonomies, this is not always guaranteed. Creating clusters of folksonomic tags around terms of controlled ontological vocabularies is a potentially sophisticated approach, but ...
Di Matteo N. +3 more
openaire +2 more sources
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
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