Results 261 to 270 of about 2,898,059 (299)
Some of the next articles are maybe not open access.
Fast operators for arbitrary warping maps
2008 IEEE International Symposium on Circuits and Systems (ISCAS), 2008In this work we describe a mathematical operator for the fast calculation of frequency warping. Such invertible transformation can be used to reshape the tiling of time- frequency analysis in a flexible way. In our approach the warping is computed by splitting the transformation operator in two additive terms: the first term represents its Nonuniform ...
CAPORALE, SALVATORE +2 more
openaire +3 more sources
Fast Mapping Skills in the Developing Lexicon
Journal of Speech, Language, and Hearing Research, 2007PurposeThis preliminary investigation was a longitudinal study of fast mapping skills in normally developing children, 16–18 months of age. The purpose was to examine the effects of practice on the accessibility of words in lexical memory.MethodEight children were taught the names of 24 unfamiliar objects over 12 weekly training sessions. The amount of
Erin R. Hahn, Lisa Gershkoff-Stowe
exaly +3 more sources
Fast composition of sparse maps
Information Processing Letters, 1982Abstract A fast algorithm for composition of sparse maps (i.e.,maps which act as the identity on most of the elements of their domain) is presented.
openaire +3 more sources
A fast distributed mapping algorithm
1990Generating an efficient program for a parallel computer requires that the distribution of the processes on the processors comprising the parallel computer is most optimal. This paper presents a new method for a load balanced and communication optimized process distribution onto an arbitrary processor (network) topology.
Jacques E. Boillat, Peter G. Kropf
openaire +1 more source
MYO-MAP—a fast recording system for epicardial mapping
Medical & Biological Engineering & Computing, 1981A low cost device for epicardial mapping, ‘MYO-MAP’ has been developed in order to shorten the mapping procedure time. It was designed using a relatively simple analogue network, combined with a spring loaded bioelectrode. The MYO-MAP can be used in the operating room to locate a reentry circuit, causing ventricular or supra-ventricular tachycardia ...
J, Dagan +6 more
openaire +2 more sources
IEEE Transactions on Acoustics, Speech, and Signal Processing, 1990
A decomposition technique for linear algorithms called the concurrent triple product (CTP) structure is tested on a class of maps which are diagonally banded. The banded maps include Toeplitz, convolution, and Hilbert transform operations, each of which is considered. The CTP and its interrelationship with array architectures is discussed.
openaire +1 more source
A decomposition technique for linear algorithms called the concurrent triple product (CTP) structure is tested on a class of maps which are diagonally banded. The banded maps include Toeplitz, convolution, and Hilbert transform operations, each of which is considered. The CTP and its interrelationship with array architectures is discussed.
openaire +1 more source
A fast and accurate explicit kernel map
Applied Intelligence, 2019Kernel functions are powerful techniques that have been used successfully in many machine learning algorithms. Explicit kernel maps have emerged as an alternative to standard kernel functions in order to overcome the latter’s scalability issues. An explicit kernel map such as Random Fourier Features (RFF) is a popular method for approximating shift ...
Deena P. Francis, Kumudha Raimond
openaire +1 more source
Interacting maps for fast visual interpretation
The 2011 International Joint Conference on Neural Networks, 2011Biological systems process visual input using a distributed representation, with different areas encoding different aspects of the visual interpretation. While current engineering habits tempt us to think of this processing in terms of a pipelined sequence of filters and other feed-forward processing stages, cortical anatomy suggests quite a different ...
Matthew Cook 0001 +4 more
openaire +1 more source
Fast plane detection in disparity maps
2010 IEEE International Conference on Image Processing, 2010We propose a new method for fast detection of planar patches in disparity maps. We first use a region growing algorithm on random seeds. This approach is similar to the one introduced in [1] for fast line segment detection in images. Then, the parameter-free criterion introduced in [2] is used to keep only the patches that are planar.
Eric Bughin +3 more
openaire +1 more source
Addressing Misconceptions of Fast Mapping in Adults
Cognitive Neuroscience, 2019Studies of fast mapping (FM) in adults have included both positive results and failures to replicate. I argue that although conflicting studies warrant caution, FM findings are nonetheless promising and intriguing. I separate the issue into distinct questions: whether FM has hippocampal independence, and whether it has unique cognitive consequences.
Marc Coutanche
exaly +3 more sources