Zobrazeno 1 - 10
of 139
pro vyhledávání: '"Higher-order programming"'
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:
Pattern Recognition. 55:261-272
This paper presents a new algorithm to approximate large margin solutions in binary classification problems with arbitrary q-norm or p-margin, where p and q are Holder conjugates. We begin by presenting the online fixed p-margin perceptron algorithm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0271ffe0b59a42c4ad29a75dbf1860f8
https://doi.org/10.1016/j.patcog.2016.01.016
https://doi.org/10.1016/j.patcog.2016.01.016
Publikováno v:
ICSE
In recent years, there has been tremendous progress in automated synthesis techniques that are able to automatically generate code based on some intent expressed by the programmer. A major challenge for the adoption of synthesis remains in having the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5076581b3ed7333852ff3f0d03e2d345
https://doi.org/10.1145/3180155.3180189
https://doi.org/10.1145/3180155.3180189
Publikováno v:
Proceedings of the ACM on Programming Languages
Proceedings of the ACM on Programming Languages, ACM, 2017, 2 (POPL), pp.1-28. ⟨10.1145/3158147⟩
Proceedings of the ACM on Programming Languages, ACM, 2017, 2 (POPL), pp.1-28. ⟨10.1145/3158147⟩
We define a notion of stable and measurable map between cones endowed with measurability tests and show that it forms a cpo-enriched cartesian closed category. This category gives a denotational model of an extension of PCF supporting the main primit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::efd54d2b63ef163c3f2053187c9d0b3a
https://hal.archives-ouvertes.fr/hal-02346093
https://hal.archives-ouvertes.fr/hal-02346093
Publikováno v:
Practical Concurrent Haskell ISBN: 9781484227800
Haskell represents a purely functional programming language that provides many advantages and the latest innovations in the design of programming languages. The most recent standard of Haskell is Haskell 2010; but in May 2016, the Haskell community s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e8a0612c5b357214913445788b972f13
https://doi.org/10.1007/978-1-4842-2781-7_2
https://doi.org/10.1007/978-1-4842-2781-7_2
Autor:
Ashwin Pajankar
Publikováno v:
Raspberry Pi Supercomputing and Scientific Programming ISBN: 9781484228777
In the last chapter, we learned how to overclock various models of Raspberry Pi to increase their computational power. In this chapter, we will learn how to write parallel programs with Python and MPI4PY. I prefer Python due to its simplicity, and th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4df94bfbdca91a5eb6286f81f1edf4e6
https://doi.org/10.1007/978-1-4842-2878-4_8
https://doi.org/10.1007/978-1-4842-2878-4_8
Autor:
Prabhat Totoo, Hans-Wolfgang Loidl
Publikováno v:
Concurrency and Computation: Practice and Experience. 26:987-1019
This paper provides an assessment of high-level parallel programming models for multi-core programming by implementing two versions of the n-body problem. We compare three different parallel programming models on the basis of parallel Haskell, differ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::89ed9dc601e4feb19556791c94b7002b
https://doi.org/10.1002/cpe.3087
https://doi.org/10.1002/cpe.3087
Autor:
Abhijat Vichare
Publikováno v:
Resonance. 18:345-367
I develop the intuition behind the λ calculus and connect it to computer programming through some basic examples. This fills an often felt gap that teachers and students find between the formal structure of the λ calculus, and the principles and pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::07015c4431268f3dbf34d086992a26a2
https://doi.org/10.1007/s12045-013-0051-1
https://doi.org/10.1007/s12045-013-0051-1
Publikováno v:
DLS
We present a straightforward, call-by-value embedding of a small logic programming language with a simple complete search. We construct the entire language in 54 lines of Racket---half of which implement unification. We then layer over it, in 43 line
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::27ba399b351aa81c4cd98b0cbe8a0e34
https://doi.org/10.1145/2989225.2989230
https://doi.org/10.1145/2989225.2989230
Publikováno v:
Anais do 7. Congresso Brasileiro de Redes Neurais.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f171e859ec69b65b3b3764b74a73a0f3
https://doi.org/10.21528/cbrn2005-229
https://doi.org/10.21528/cbrn2005-229