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

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

2000
J. Z. Farkas

The geometrization of 3-manifolds plays an important role in various topological investigations and in the geometry as well. Thurston classified the eight simply connected 3-dimensional maximal homogeneous Riemannian geometries [7], [8]. One of these is S×R, i.e. the direct product of the spherical plane S and the real line R. Our purpose is the classification of the space groups of S×R, i.e. d...

Journal: :Acta Cybern. 2007
Ervin Melkó Benedek Nagy

In this paper, games with chance nodes are analysed. The evaluation of these game trees uses the expectiminimax algorithm. We present pruning techniques involving random effects. The gamma-pruning aims at increasing the efficiency of expectiminimax (analogously to alpha-beta pruning and the classical minimax). Some interesting properties of these games are shown: for instance, a game without dr...

Journal: :CoRR 2014
Vladimir V. Bochkarev Yulia S. Maslennikova

In this paper, a new method was developed for initialising artificial neural networks predicting dynamics of time series. Initial weighting coefficients were determined for neurons analogously to the case of a linear prediction filter. Moreover, to improve the accuracy of the initialization method for a multilayer neural network, some variants of decomposition of the transformation matrix corre...

Journal: :CoRR 2012
Ugo Dal Lago Paolo Parisen Toldin

We present RSLR, an implicit higher-order characterization of the class PP of those problems which can be decided in probabilistic polynomial time with error probability smaller than 1/2. Analogously, a (less implicit) characterization of the class BPP can be obtained. RSLR is an extension of Hofmann’s SLR with a probabilistic primitive, which enjoys basic properties such as subject reduction a...

2003
Jan Bredereke

Naive feature orientation runs into problems with large software systems, such as telephone switching systems. With naive feature orientation, a feature extends a base system by an arbitrary increment of functionality. Information hiding helps to structure a large software system design into modules such that it can be maintained. We focus on the requirements of a software system. Requirements ...

2001
Georg Ziegler Willi Kantlehner Gerhard Simchen

Z. Naturforsch. 56 b, 1172-1177 (2001); received July 13, 2001 Aryl Formates, Formylation, Hydroxyarenes Aryl formates 4a-u, 6 , 8 , 10, 12, 14, 16, 18, 20, 22, 24, 26 are prepared by formylation of hydroxyarenes 3a-u, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25 with /V,Af-diformylacetamide (1) or triformamide (2), respectively, in fairly good yields. The reactions can be catalyzed by sodium diform...

2015
Paolo Tomeo Tommaso Di Noia Marco Degemmis Pasquale Lops Giovanni Semeraro Eugenio Di Sciascio

Diversity in a recommendation list has been recognized as one of the key factors to increase user’s satisfaction when interacting with a recommender system. Analogously to the modelling and exploitation of query intent in Information Retrieval adopted to improve diversity in search results, in this paper we focus on eliciting and using the profile of a user which is in turn exploited to represe...

2014
Zalán Bodó Lehel Csató

Hashing methods for fast approximate nearest-neighbor search are getting more and more attention with the excessive growth of the available data today. Embedding the points into the Hamming space is an important question of the hashing process. Analogously to machine learning there exist unsupervised, supervised and semi-supervised hashing methods. In this paper we propose a generic procedure t...

2009
E. Minguzzi

A classical result in Lorentzian geometry states that a strongly causal spacetime is globally hyperbolic if and only if the Lorentzian distance is finite valued for every metric choice in the conformal class. It is proven here that a non-total imprisoning spacetime is causally simple if and only if for every metric choice in the conformal class the Lorentzian distance is continuous wherever it ...

2005
Supphanat Kanokphara Julie Carson-Berndsen

The majority of speech recognition systems today commonly use Hidden Markov Models (HMMs) as acoustic models in systems since they can powerfully train and map a speech utterance into a sequence of units. Such systems perform even better if the units employed are context-dependent and gender-dependent. Analogously, when HMM technology is applied to the problem of articulatory feature extraction...

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

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