Results 261 to 270 of about 505,151 (317)
Some of the next articles are maybe not open access.
Averaging, selective averaging and latency-corrected averaging
Pflügers Archiv - European Journal of Physiology, 1981Although latency-corrected averaging and selective averaging represent frequency used alternatives to the time-locked averaging, little is known about the changes of the signal-to-noise ratio (SNR) associated with their application. For this reason, visual evoked responses (VERs) to blank and checkerboard patterned flashes of light (5.6 cd/m2) were ...
J, Peregrin, M, Valach
openaire +2 more sources
Is average face recognized as the average
2007 9th International Symposium on Signal Processing and Its Applications, 2007In this paper, we address a very basic question of whether the average face of two face images is recognized as the average by a human. First, average faces were calculated for each of the pairs of images in our stimuli samples. Then, we conducted psychological experiments to compare an average face with two of the face images that were utilized for ...
Naiwala Pathirannehelage Chandrasiri +5 more
openaire +1 more source
Average Faces Are Average Faces
Current Psychology, 1999Photographs of faces of young adult male and female Scots were measured on nineteen frontal dimensions. Measures in each dimension were converted to z-scores and summed for each face. For each sex, the ten faces closest to the average summed z-score and the ten most distant from it were rated for attractiveness by white male and female New Zealand ...
Jim Pollard +2 more
openaire +1 more source
Math Bite: When an Average of Averages is the Average
Mathematics Magazine, 2019If you want to find the mean of a data set, you would not, say, split the data in half, find the average of each half, and average those results.
Tristen Pankake-Sieminski +1 more
openaire +1 more source
Determining Averaging Functions in Average Sampling
IEEE Signal Processing Letters, 2007Average sampling has been developed recently. In this letter, we study determining of averaging functions in an average sampling scheme by means of test functions.
Bei Liu, Wenchang Sun
openaire +1 more source
[1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 2003
Structures of polynomial-time computable distributions and polynomial-time many-one reductions on randomized decision problems are investigated. The scope is widened from the most studied class DNP (distributional-NP) to the class ANP (average-NP), which consists of randomized decision problems accepted by nondeterministic Turing machines in average ...
Jay Belanger, Jie Wang 0002
openaire +1 more source
Structures of polynomial-time computable distributions and polynomial-time many-one reductions on randomized decision problems are investigated. The scope is widened from the most studied class DNP (distributional-NP) to the class ANP (average-NP), which consists of randomized decision problems accepted by nondeterministic Turing machines in average ...
Jay Belanger, Jie Wang 0002
openaire +1 more source
2006
Despite their popularity, lattice reduction algorithms remain mysterious in many ways. It has been widely reported that they behave much more nicely than what was expected from the worst-case proved bounds, both in terms of the running time and the output quality.
Nguyen, Phong, Stehle, Damien
openaire +2 more sources
Despite their popularity, lattice reduction algorithms remain mysterious in many ways. It has been widely reported that they behave much more nicely than what was expected from the worst-case proved bounds, both in terms of the running time and the output quality.
Nguyen, Phong, Stehle, Damien
openaire +2 more sources
Journal of Mathematical Imaging and Vision, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources