نتایج جستجو برای: bidirectional

تعداد نتایج: 19675  

2010
Asaf Shiloni Alon Levy Ariel Felner Meir Kalech

Ant robots have very low computational power and limited memory. They communicate by leaving pheromones in the environment. In order to create a cooperative intelligent behavior, ants may need to get together; however, they may not know the locations of other ants. Hence, we focus on an ant variant of the rendezvous problem, in which two ants are to be brought to the same location in finite tim...

Journal: :Journal of experimental child psychology 2012
Gregory J Poarch Janet G van Hell

In five experiments, we examined cross-language activation during speech production in various groups of bilinguals and trilinguals who differed in nonnative language proficiency, language learning background, and age. In Experiments 1, 2, 3, and 5, German 5- to 8-year-old second language learners of English, German-English bilinguals, German-English-Language X trilinguals, and adult German-Eng...

Journal: :Energies 2022

Bidirectional DC–DC converters are key devices in the DC distribution system and energy storage (ESS). It is important to consider safety of elements converter for rapid conversion power direction. Damages may occur power-related components circuit if direction inductor current or capacitor voltage changes instantaneously. To make flow change smoothly quickly, this research proposed a bidirecti...

2009
Hossein Behbood Seyyed Ali Seyyedsalehi Hamid Reza Tohidypour

In this paper, a new bidirectional neural network for better acoustic-articulatory inversion mapping is proposed. The model is motivated by the parallel structure of human brain, processing information by having forward-inverse connections. In other words, there would be a feedback from articulatory system to the acoustic signals emitted from that organ. Inspired by this mechanism, a new bidire...

Journal: :Neural networks : the official journal of the International Neural Network Society 2005
Alex Graves Jürgen Schmidhuber

In this paper, we present bidirectional Long Short Term Memory (LSTM) networks, and a modified, full gradient version of the LSTM learning algorithm. We evaluate Bidirectional LSTM (BLSTM) and several other network architectures on the benchmark task of framewise phoneme classification, using the TIMIT database. Our main findings are that bidirectional networks outperform unidirectional ones, a...

1984
Henry W. Davis Randy B. Pollack Thomas Sudkamp

Three admissible bidirectional search algorithms have been described in the literature: A Cartesian product approach due to Doran, Pohl's BHPA, and Champeaux and Sint's BHFFA2. This paper describes an algorithm, GP, which contains the latter two and others. New admissibility results are obtained. A first order analysis is made comparing the run times of Cartesian produc$ search, two versions of...

1994
Gertjan van Noord

In this paper it will be shown how uniication grammars can be used to build a reversible machine translation system. Uniication grammars are often used to deene the relation between strings and meaning representations in a declarative way. Such grammars are sometimes used in a bidirectional way, thus the same grammar is used for both parsing and generation. In this paper I will show how to use ...

Journal: :IEEE Trans. Systems, Man, and Cybernetics 1995
Andrew Chi-Sing Leung Lai-Wan Chan Edmund Man Kit Lai

Psychophysical representations built by Gabor visual chan-nels described in complex analytic form are shown to be related to thewavelet transform of visual stimuli under empirically plausible bandwidthconstraints. Analysis of the psychophysical wavelet representations ofone-dimensional stimuli eliciting some visual contrast illusions (Machbands and the Craik-Cornsweet-O’Brie...

2014
Zeljko Agic Alexander Koller

We present the Potsdam systems that participated in the semantic dependency parsing shared task of SemEval 2014. They are based on linguistically motivated bidirectional transformations between graphs and trees and on utilization of syntactic dependency parsing. They were entered in both the closed track and the open track of the challenge, recording a peak average labeled F1 score of 78.60.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید