Ishanu Chattopadhyay. Интересный исследователь идущий из теорвера и из чего-то мне пока что непонятного. Он собственно и концептуализировал подход data-smashing.
http://home.uchicago.edu/~ishanu/ResearchPhilosophy.html
The algebraic structure of the space of PFSAs (Probalistic Finite State Automatos) (in particular, existence of unique group inverses) is key to the information annihilation principle; however we argue that any quantized ergodic stationary stochastic process is indeed representable as a probabilistic automata.
https://www.aaai.org/ocs/index.php/WS/AAAIW14/paper/viewFile/8843/8339
#bci #people #stat #research #datasmash
http://home.uchicago.edu/~ishanu/ResearchPhilosophy.html
The algebraic structure of the space of PFSAs (Probalistic Finite State Automatos) (in particular, existence of unique group inverses) is key to the information annihilation principle; however we argue that any quantized ergodic stationary stochastic process is indeed representable as a probabilistic automata.
https://www.aaai.org/ocs/index.php/WS/AAAIW14/paper/viewFile/8843/8339
#bci #people #stat #research #datasmash
Ishanu Chattopadhyay. Интересный исследователь идущий из теорвера и из чего-то мне пока что непонятного. Он собственно и концептуализировал подход data-smashing.
http://home.uchicago.edu/~ishanu/ResearchPhilosophy.html
The algebraic structure of the space of PFSAs (Probalistic Finite State Automatos) (in particular, existence of unique group inverses) is key to the information annihilation principle; however we argue that any quantized ergodic stationary stochastic process is indeed representable as a probabilistic automata.
https://www.aaai.org/ocs/index.php/WS/AAAIW14/paper/viewFile/8843/8339
#bci #people #stat #research #datasmash
http://home.uchicago.edu/~ishanu/ResearchPhilosophy.html
The algebraic structure of the space of PFSAs (Probalistic Finite State Automatos) (in particular, existence of unique group inverses) is key to the information annihilation principle; however we argue that any quantized ergodic stationary stochastic process is indeed representable as a probabilistic automata.
https://www.aaai.org/ocs/index.php/WS/AAAIW14/paper/viewFile/8843/8339
#bci #people #stat #research #datasmash
У записи 3 лайков,
1 репостов.
1 репостов.
Эту запись оставил(а) на своей стене Наима Джошуа
