Zobrazeno 1 - 10
of 153
pro vyhledávání: '"Uustalu, T."'
Autor:
Bocharova, Irina E., Kudryashov, Boris D., Ovsyannikov, Evgenii P., Skachek, Vitaly, Uustalu, T��hvend
We propose an approach for optimizing nonbinary (NB) quasi-cyclic (QC) LDPC codes. This approach combines constructing of base parity-check matrices by simulated annealing and labeling the obtained base matrices aimed at maximizing the so-called gene
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bc8e09c9a31f81e40fbc7944ae866000
http://arxiv.org/abs/2006.12147
http://arxiv.org/abs/2006.12147
Publikováno v:
Uustalu, T. (ed.), TYPES 2015: 21st International Conference on Types for Proofs and Programs, pp. 1:1-1:34
Uustalu, T. (ed.), TYPES 2015: 21st International Conference on Types for Proofs and Programs, 1:1-1:34. Schloss Dagstuhl : Dagstuhl Publishing
STARTPAGE=1:1;ENDPAGE=1:34;ISSN=1868-8969;TITLE=Uustalu, T. (ed.), TYPES 2015: 21st International Conference on Types for Proofs and Programs
Uustalu, T. (ed.), TYPES 2015: 21st International Conference on Types for Proofs and Programs, 1:1-1:34. Schloss Dagstuhl : Dagstuhl Publishing
STARTPAGE=1:1;ENDPAGE=1:34;ISSN=1868-8969;TITLE=Uustalu, T. (ed.), TYPES 2015: 21st International Conference on Types for Proofs and Programs
This paper introduces a novel type theory and logic for probabilistic reasoning. Its logic is quantitative, with fuzzy predicates. It includes normalisation and conditioning of states. This conditioning uses a key aspect that distinguishes our probab
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c2fecffd6f7681f2466a4c33969c1493
https://hdl.handle.net/2066/191731
https://hdl.handle.net/2066/191731
Autor:
Achten, P.M., Eekelen, M.C.J.D. van, Plasmeijer, M.J., Weelden, A. van, Vene, W., Uustalu, T.
Publikováno v:
Vene, W.; Uustalu, T. (ed.), Advanced Functional Programming : 5th International School on Advanced Functional Programming, AFP2004, Tartu, Estonia, August 14-21, 2004, Revised Lectures, 210-244. Berlin : Springer
STARTPAGE=210;ENDPAGE=244;ISSN=0302-9743;TITLE=Vene, W.; Uustalu, T. (ed.), Advanced Functional Programming : 5th International School on Advanced Functional Programming, AFP2004, Tartu, Estonia, August 14-21, 2004, Revised Lectures
Vene, W.; Uustalu, T. (ed.), Advanced Functional Programming : 5th International School on Advanced Functional Programming, AFP2004, Tartu, Estonia, August 14-21, 2004, Revised Lectures, pp. 210-244
ftp://ftp.cs.kun.nl/pub/Clean/papers/2004/achp2004-GEC_AFP.pdf
STARTPAGE=210;ENDPAGE=244;ISSN=0302-9743;TITLE=Vene, W.; Uustalu, T. (ed.), Advanced Functional Programming : 5th International School on Advanced Functional Programming, AFP2004, Tartu, Estonia, August 14-21, 2004, Revised Lectures
Vene, W.; Uustalu, T. (ed.), Advanced Functional Programming : 5th International School on Advanced Functional Programming, AFP2004, Tartu, Estonia, August 14-21, 2004, Revised Lectures, pp. 210-244
ftp://ftp.cs.kun.nl/pub/Clean/papers/2004/achp2004-GEC_AFP.pdf
Contains fulltext : 60461_pub.pdf (Publisher’s version ) (Open Access) Contains fulltext : 60461_pre.pdf (Author’s version preprint ) (Open Access) GUI programming is notoriously tedious. By using generic functions that create Graphical Editor Co
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
McBride, C.; Uustalu, T. (ed.), Workshop on Mathematically Structured Functional Programming (MSFP 2006)
McBride, C.; Uustalu, T. (ed.), Workshop on Mathematically Structured Functional Programming (MSFP 2006). Swindon, UK : BCS
McBride, C.; Uustalu, T. (ed.), Workshop on Mathematically Structured Functional Programming (MSFP 2006). Swindon, UK : BCS
Contains fulltext : 35849.pdf (Publisher’s version ) (Open Access)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::ddebb6cdd04d114cf4dc155fbbfe505e
https://hdl.handle.net/2066/35849
https://hdl.handle.net/2066/35849
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Vene, V.; Uustalu, T. (ed.), . 5th International School on Advanced Functional Programming, AFP2004. Revised Lectures., 245-272. [S.l.] : Springer
STARTPAGE=245;ENDPAGE=272;TITLE=Vene, V.; Uustalu, T. (ed.), . 5th International School on Advanced Functional Programming, AFP2004. Revised Lectures.
Vene, V.; Uustalu, T. (ed.), . 5th International School on Advanced Functional Programming, AFP2004. Revised Lectures., pp. 245-272
ftp://ftp.cs.kun.nl/pub/Clean/papers/2004/plar2004-Esther_AFP.pdf
STARTPAGE=245;ENDPAGE=272;TITLE=Vene, V.; Uustalu, T. (ed.), . 5th International School on Advanced Functional Programming, AFP2004. Revised Lectures.
Vene, V.; Uustalu, T. (ed.), . 5th International School on Advanced Functional Programming, AFP2004. Revised Lectures., pp. 245-272
ftp://ftp.cs.kun.nl/pub/Clean/papers/2004/plar2004-Esther_AFP.pdf
Contains fulltext : 60595.pdf (author's version ) (Open Access) Esther is the interactive shell of Famke, a prototype implementation of a strongly typed operating system written in the functional programming language Clean. As usual, the shell can be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::10bc1d05a0e655d7b7e488f150a8f273
https://hdl.handle.net/2066/60595
https://hdl.handle.net/2066/60595
Publikováno v:
6th Workshop on Fixed Points in Computer Science, FICS 2009: Coimbra, Portugal, 12-13 September 2009: Proceedings, 30-38
STARTPAGE=30;ENDPAGE=38;TITLE=6th Workshop on Fixed Points in Computer Science, FICS 2009: Coimbra, Portugal, 12-13 September 2009: Proceedings
STARTPAGE=30;ENDPAGE=38;TITLE=6th Workshop on Fixed Points in Computer Science, FICS 2009: Coimbra, Portugal, 12-13 September 2009: Proceedings
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::b5616390fa736ccdc329c41caf1d7d0b
https://dare.uva.nl/personal/pure/en/publications/an-easy-completeness-proof-for-the-modal-calculus-on-finite-trees(5aac9d57-3250-4270-8922-5774b1810700).html
https://dare.uva.nl/personal/pure/en/publications/an-easy-completeness-proof-for-the-modal-calculus-on-finite-trees(5aac9d57-3250-4270-8922-5774b1810700).html
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.