Loading...
Search for: ideal-model
0.005 seconds

    MDL-CW: A multimodal deep learning framework with cross weights

    , Article 2016 IEEE Conference on Computer Vision and Pattern Recognition, 26 June 2016 through 1 July 2016 ; Volume 2016-January , 2016 , Pages 2601-2609 ; 10636919 (ISSN) ; 9781467388511 (ISBN) Rastegar, S ; Soleymani Baghshah, M ; Rabiee, H. R ; Shojaee, S. M ; Sharif University of Technology
    IEEE Computer Society 
    Abstract
    Deep learning has received much attention as of the most powerful approaches for multimodal representation learning in recent years. An ideal model for multimodal data can reason about missing modalities using the available ones, and usually provides more information when multiple modalities are being considered. All the previous deep models contain separate modality-specific networks and find a shared representation on top of those networks. Therefore, they only consider high level interactions between modalities to find a joint representation for them. In this paper, we propose a multimodal deep learning framework (MDLCW) that exploits the cross weights between representation of... 

    Abstract geometrical computation 10: An intrinsically universal family of signal machines

    , Article ACM Transactions on Computation Theory ; Volume 13, Issue 1 , 2021 ; 19423454 (ISSN) Becker, F ; Besson, T ; Durand Lose, J ; Emmanuel, A ; Foroughmand Araabi, M. H ; Goliaei, S ; Heydarshahi, S ; Sharif University of Technology
    Association for Computing Machinery  2021
    Abstract
    Signal machines form an abstract and idealized model of collision computing. Based on dimensionless signals moving on the real line, they model particle/signal dynamics in Cellular Automata. Each particle, or signal, moves at constant speed in continuous time and space. When signals meet, they get replaced by other signals. A signal machine defines the types of available signals, their speeds, and the rules for replacement in collision. A signal machine A simulates another one B if all the space-time diagrams of B can be generated from space-time diagrams of A by removing some signals and renaming other signals according to local information. Given any finite set of speeds S we construct a...