Concept

Associativité des puissances

Publications associées (9)

Transformers are RNNs: Fast Autoregressive Transformers with Linear Attention

François Fleuret, Nikolaos Pappas, Angelos Katharopoulos, Apoorv Vyas

Transformers achieve remarkable performance in several tasks but due to their quadratic complexity, with respect to the input’s length, they are prohibitively slow for very long sequences. To address this limitation, we express the self-attention as a line ...

Idiap2020

Interactions of spatial strategies producing generalization gradient and blocking: A computational approach

Ricardo Andres Chavarriaga Lozano

We present a computational model of spatial navigation comprising different learning mechanisms in mammals, i.e., associative, cognitive mapping and parallel systems. This model is able to reproduce a large number of experimental results in different varia ...

2018

The Hochschild complex of a twisting cochain

Kathryn Hess Bellwald

Given any twisting cochain t:C→A , where C is a connected, coaugmented chain coalgebra and A is an augmented chain algebra over an arbitrary commutative ring R, we construct a twisted extension of chain complexes Full-size image (1 K) of which both the wel ...

Elsevier2016

Quantum Chemical Study of the Water Exchange Mechanism of the Americyl(VI) Aqua Ion

François Rotzinger, Alberto Fabrizio

The water exchange reaction of the americyl(VI) aqua ion was investigated with quantum chemical methods, density functional theory (DFT), and wave function theory (WFT). Associative and dissociative substitution mechanisms were studied, whereby DFT produce ...

American Chemical Society2016

Obligatory averaging in mean size perception

Aire Raidvee

The perception of ensemble characteristics is often regarded as an antidote to an established bottleneck in focused attention and working memory, both of which appear to be limited in capacity to a few objects only. In order to test the associative law of ...

Elsevier2014

Isomorphism Problems of Noncommutative Deformations of Type D Kleinian Singularities

We construct all possible noncommutative deformations of a Kleinian singularity C-2/Gamma of type D-n in terms of generators and relations, and solve the isomorphism problem for the associative algebras thus constructed. We prove that (in our parametrizati ...

2009

A Clustering Method Based on Soft Learning of Model (Prototype) and Dissimilarity Metrics

Arash Arami

Many clustering methods are designed for especial cluster types or have good performance dealing with particular size and shape of clusters. The main problem in this connection is how to define a similarity (or dissimilarity) criterion to make an algorithm ...

Springer-Verlag2009

Modelling human perception of static expressions by discrete choice models

Jean-Philippe Thiran, Matteo Sorci, Barbara Cerretani

When people interact to communicate, a very important role is played by the face. In fact, thanks to it we can get information about our interlocutors: who they are, what they feel, what their intentions are, etc. Studies demonstrated that facial expressio ...

2007

Method and device for the genetic representation and evolution of networks

Dario Floreano, Claudio Mattiussi

A method for the genetic representation of a network (100), the network having one or more devices (20, 30, 70, 80), each device comprising at least one terminal (21, 22, 23; 71, 72) connected to at least one other terminal (21, 22, 23; 71, 72, 61) by a li ...

2007

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search