Zobrazeno 1 - 10
of 160
pro vyhledávání: '"Nir Shavit"'
Autor:
Andrew D. Chisholm, Richard Schalek, Yufang Liu, Wan Xian Koh, Ben Mulcahy, Jeff W. Lichtman, Yaron Meirovitch, Yuelong Wu, Daniel R. Berger, James K. Mitchell, Rajeev Parvathala, Douglas Holmyard, Nir Shavit, Mei Zhen, Daniel Witvliet, Aravinthan D. T. Samuel
Publikováno v:
Nature
An animal’s nervous system changes as its body grows from birth to adulthood and its behaviours mature1–8. The form and extent of circuit remodelling across the connectome is unknown3,9–15. Here we used serial-section electron microscopy to rec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::166538207a021defa578197b10476fa3
https://doi.org/10.1038/s41586-021-03778-8
https://doi.org/10.1038/s41586-021-03778-8
Autor:
Chen Sun, Xiaohan Jin, Cordelia Schmid, Yuning Chai, Nir Shavit, Lu Mi, Charlie Nash, Hang Zhao, Dragomir Anguelov, Jiyang Gao
Publikováno v:
CVPR
High Definition (HD) maps are maps with precise definitions of road lanes with rich semantics of the traffic rules. They are critical for several key stages in an autonomous driving system, including motion forecasting and planning. However, there ar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::747de3b46b227b1a2550f114710e3caf
http://arxiv.org/abs/2106.14880
http://arxiv.org/abs/2106.14880
Publikováno v:
Springer Berlin Heidelberg
For many years, Herlihy’s elegant computability-based Consensus Hierarchy has been our best explanation of the relative power of various objects. Since real multiprocessors allow the different instructions they support to be applied to any memory l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a401b5aa044630d3729db22d92802ca4
https://doi.org/10.1007/s00446-019-00361-3
https://doi.org/10.1007/s00446-019-00361-3
This chapter describes how to use consensus objects to build a universal construction, an algorithm for implementing a linearizable concurrent object for any sequential object type. It presents two algorithms, a lock-free one and a wait-free one. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5d8a68af336da401de7384d5a640e5a9
https://doi.org/10.1016/b978-0-12-415950-1.00015-x
https://doi.org/10.1016/b978-0-12-415950-1.00015-x
This chapter covers several useful patterns for distributed coordination: combining, counting, diffraction, and sampling. Some of these techniques are deterministic; others use randomization. We cover two basic structures underlying these patterns, t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::87bd655748fb4c61337080c524674ade
https://doi.org/10.1016/b978-0-12-415950-1.00022-7
https://doi.org/10.1016/b978-0-12-415950-1.00022-7