Filters








363 Hits in 3.9 sec

To the Memory of R. Freivalds

Efim Kinber
2016 Baltic Journal of Modern Computing  
The paper contains author's memories of his mentor and teacher R. M. Freivalds.  ...  I met Rūsiņš Freivalds for the first time in September of 1970, and this meeting defined my life in many different ways.  ...  Acknowledgements I am grateful to R. McCloud and D. Taimina for a number of suggestions that greatly improved the style of the paper.  ... 
doi:10.22364/bjmc.2016.4.4.05 fatcat:tt27i6qrcnepphlv6if3dfpqsy

Rūsiņš Mārtiņš Freivalds: Academic Genealogy and Selected Publications

Rūsiņš Mārtiņš Freivalds, Solvita Zariņa
2016 Baltic Journal of Modern Computing  
Freivalds: Completeness up to coding of systems of functions in multivalued logics and the complexity of its recognition. "Doklady AN SSSR", 1968, vol. 180, No. 4, pp. 803-805 (in Russian) 137. R.  ...  Freivalds: Methods and languages to prove the power of probabilistic machines. Proceedings of IFIP Congress'83 "Information Processing'83", Elsevier, 1983, pp. 157-162 112. R. Freivalds, E. B.  ... 
doi:10.22364/bjmc.2016.4.4.02 fatcat:i6z5ncr4ivcznhq3qdl65z4lnq

Slalom: Fast, Verifiable and Private Execution of Neural Networks in Trusted Hardware [article]

Florian Tramèr, Dan Boneh
2019 arXiv   pre-print
This paper initiates the study of high performance execution of Deep Neural Networks (DNNs) in TEEs by efficiently partitioning DNN computations between trusted and untrusted devices.  ...  A pragmatic solution comes from Trusted Execution Environments (TEEs), which use hardware and software protections to isolate sensitive computations from the untrusted software stack.  ...  in Freivalds' algorithm, and in F for the blinding vectors r i ).  ... 
arXiv:1806.03287v2 fatcat:bltsrqkdizc45clfer7durbsbq

Author index volume 110 (1993)

1993 Theoretical Computer Science  
Wymann-Bon], How to decide the lark (,YN~) Van Leeuwen. J.. Editorial introducing the Tutorial Section Wichagen. R.. .$<Y R. Freivalds Wymann-Boni, M.. .sre M. Sprenger Zwich. U. and MS. Paterson.  ...  The memory game (Publishers B.V.  ... 
doi:10.1016/0304-3975(93)90016-m fatcat:nynjz7bcyfetxby7tacfry5qdq

Gaussian Variant of Freivalds' Algorithm for Efficient and Reliable Matrix Product Verification [article]

Hao Ji, Michael Mascagni, Yaohang Li
2017 arXiv   pre-print
Here we extend Freivalds' algorithm to a Gaussian Variant of Freivalds' Algorithm (GVFA) by projecting the product A × B as well as C onto a Gaussian random vector and then comparing the resulting vectors  ...  The computational complexity of GVFA is consistent with that of Freivalds' algorithm, which is O(n^2).  ...  The mention of any commercial product or service in this paper does not imply an endorsement by NIST or the Department of Commerce.  ... 
arXiv:1705.10449v1 fatcat:j3repvhjmnaitblp6xwch7iwwm

Quantum inductive inference by finite automata

R. Freivalds, R.F. Bonner
2008 Theoretical Computer Science  
Freivalds and Smith [R. Freivalds, C.H.  ...  1 certain classes of total recursive functions, which cannot be learned by deterministic limited memory inductive inference machines.  ...  Acknowledgment The first author's research was supported by Grant No. 05.1528 from the Latvian Council of Science, Contract IST-1999-11234 (QAIP) from the European Commission, and the Swedish Institute  ... 
doi:10.1016/j.tcs.2008.02.023 fatcat:4vvokuge2fb3blvri2clio77za

Residual Shuffle-Exchange Networks for Fast Processing of Long Sequences

Andis Draguns, Emīls Ozoliņš, Agris Šostaks, Matīss Apinis, Karlis Freivalds
2021 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
Attention is a commonly used mechanism in sequence processing, but it is of O(n^2) complexity which prevents its application to long sequences.  ...  The proposed architecture not only scales to longer sequences but also converges faster and provides better accuracy.  ...  Acknowledgements We would like to thank the IMCS UL Scientific Cloud for the computing power and Leo Trukšāns for the technical support.  ... 
doi:10.1609/aaai.v35i8.16890 fatcat:bbi3274dzrcffpd3ehsrt45ria

Neural Shuffle-Exchange Networks - Sequence Processing in O(n log n) Time

Karlis Freivalds, Emils Ozolins, Agris Sostaks
2019 Neural Information Processing Systems  
To this end, a vast majority of the state-of-the-art models use attention mechanism which is of O(n 2 ) complexity that leads to slow execution for long sequences.  ...  A key requirement in sequence to sequence processing is the modeling of long range dependencies.  ...  Acknowledgements We would like to thank Renārs Liepin , š for the valuable discussion regarding the subject matter of the paper, the IMCS UL Scientific Cloud for the computing power and Leo Trukšāns for  ... 
dblp:conf/nips/FreivaldsOS19 fatcat:ogdbdlylvjem3n3z5tcjtkbaz4

Neural Shuffle-Exchange Networks – Sequence Processing in O(n log n) Time [article]

Kārlis Freivalds, Emīls Ozoliņš, Agris Šostaks
2019 arXiv   pre-print
To this end, a vast majority of the state-of-the-art models use attention mechanism which is of O(n^2) complexity that leads to slow execution for long sequences.  ...  A key requirement in sequence to sequence processing is the modeling of long range dependencies.  ...  Acknowledgements We would like to thank Renārs Liepin , š for the valuable discussion regarding the subject matter of the paper, the IMCS UL Scientific Cloud for the computing power and Leo Trukšāns for  ... 
arXiv:1907.07897v3 fatcat:g644nxdyxjakhjw2t6jbnfumta

Page 3222 of Mathematical Reviews Vol. 58, Issue 5 [page]

1979 Mathematical Reviews  
.]; Freivald, R. V. [Freivalds, R.] Prediction and identification in the limit of effectively countable classes of functions. (Russian) Latviisk. Gos. Univ. Uéen.  ...  From the introduction: “We aim to give a machine-independent characterization of the complexity of computable functions for such measures of complexity as computing time and memory capacity.” ‘ 3 {English  ... 

Page 3236 of Mathematical Reviews Vol. , Issue 97E [page]

1997 Mathematical Reviews  
Summary: “We consider inductive inference with limited memory [R. Freivalds, E. B. Kinber and C. H. Smith, J. Assoc. Comput. Mach. 42 (1995), no. 6, 1146-1168].  ...  (and some amount of short-term memory); (3) if U is learned with sublinear long- term memory, then the short-term memory exceeds an arbitrary recursive function.  ... 

Page 1542 of Mathematical Reviews Vol. , Issue 88c [page]

1988 Mathematical Reviews  
., Riga, 1986. 200 pp. 1.50 r. Contents: R. V. Freivald [Rosin Freivalds], On probabilistic and deterministic Turing machines with input and output (pp. 4-22, 190, 197); D. G.  ...  Summary: “The power of shared-memory in models of parallel computation is studied, and a novel distributed data structure that eliminates the need for shared memory without significantly in- creasing the  ... 

Residual Shuffle-Exchange Networks for Fast Processing of Long Sequences [article]

Andis Draguns, Emīls Ozoliņš, Agris Šostaks, Matīss Apinis, Kārlis Freivalds
2021 arXiv   pre-print
Attention is a commonly used mechanism in sequence processing, but it is of O(n^2) complexity which prevents its application to long sequences.  ...  The proposed architecture not only scales to longer sequences but also converges faster and provides better accuracy.  ...  Acknowledgements We would like to thank the IMCS UL Scientific Cloud for the computing power and Leo Trukšāns for the technical support.  ... 
arXiv:2004.04662v4 fatcat:zslfyfefujcb7gw2djy5t57g3q

Page 1824 of Mathematical Reviews Vol. 56, Issue 5 [page]

1978 Mathematical Reviews  
{For the entire collection see MR 54 #4884.} Freivald, R. V. [Freivalds, R.] 13793 Probabilistic recognition, with isolated intersection point, of deterministically unrecognizable sets.  ...  computable function has good classes of provably equivalent programs in which it is possible to effectively find very large speedups and to prove both the correctness and the good running times of the  ... 

Efficiently Correcting Matrix Products

Leszek Gąsieniec, Christos Levcopoulos, Andrzej Lingas, Rasmus Pagh, Takeshi Tokuyama
2016 Algorithmica  
We study the problem of efficiently correcting an erroneous product of two n × n matrices over a ring.  ...  A preliminary, short version of this paper with weaker bounds in the randomized setting has appeared in  ...  More precisely, it takes time O( p · r ) to compute C x T , O(q · r ) to compute Bx T , and finally O( p · q) to compute the product of A with Bx T .  ... 
doi:10.1007/s00453-016-0202-3 fatcat:zyc6mb52kvc3xm3sabeg3e6kfm
« Previous Showing results 1 — 15 out of 363 results