We used visual search to explore whether attention could be guided by Kanizsa-type subjective contours and by subjective contours induced by line ends. Unlike in previous experiments, we compared search performance with subjective contours against performance with real, luminance contours, and we had observers search for orientations or shapes produced by subjective contours, rather than search...

SUMMARY If the points of a finite projective plane with s+l points on a line are identified with the elements of the basic set Sn of search and the lines with the functions of a system F of search, then the incidence matrix of the plane defines a separating system of search on F. Bounds on probabilities of termination of search processes when functions are chosen by random sampling with replace...

where | · | denotes the `1 norm, ‖·‖ denotes the `2 norm, A is a matrix, b is a vector, and μ is a scalar parameter. This problem is of the form (1) with g(z) = μ|z|, and f(z) = 12‖z− b‖ . More generally, any problem of the form (1) can be solved by FASTA, provided the user can provide function handles to f, g, A and A . The solver FASTA contains numerous enhancements of FBS to improve converge...

In this paper we study the question of whether or not a static search tree should ever be unbalanced. We present several methods to restructure an unbalanced k-ary search tree T into a new tree R that preserves many of the properties of T while having a height of log k n+1 which is one unit off of the optimal height. More specifically, we show that it is possible to ensure that the depth of the...

This article may be used for research, teaching, and private study purposes. Any substantial or systematic reproduction, redistribution, reselling, loan, sub-licensing, systematic supply, or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to date...

Finite-sum problems appear as the sample average approximation of a stochastic optimization problem and often arise in machine learning applications with large scale data sets. A very popular approach to face finite-sum is gradient method. It well known that proper strategy select hyperparameters this method (i.e. set a-priori selected parameters) and, particular, rate, needed guarantee converg...