Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Ondrej Sykora"'
Autor:
Xinliang David Li, Sam Likun Xi, Chris Kennelly, Guillaume Chatelet, Clement Courbet, Bruno de Backer, Ondrej Sykora
Publikováno v:
Proceedings of the 2021 ACM SIGPLAN International Symposium on Memory Management.
Memory manipulation primitives (memcpy, memset, memcmp) are used by virtually every application, from high performance computing to user interfaces. They often consume a significant portion of CPU cycles. Because they are so ubiquitous and critical,
Autor:
Charith Mendis, Saman Amarasinghe, Eric Atkinson, Ajay Brahmakshatriya, Alex Renda, Michael Carbin, Yishen Chen, Ondrej Sykora
Publikováno v:
MIT web domain
IISWC
IISWC
Compilers and performance engineers use hardware performance models to simplify program optimizations. Performance models provide a necessary abstraction over complex modern processors. However, constructing and maintaining a performance model can be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d8ec320421441139589eb0ab66b35930
https://hdl.handle.net/1721.1/128755
https://hdl.handle.net/1721.1/128755
Publikováno v:
ICTAI (1)
Mobile robot localization is taken into account as one of the most important topics in robotics. In this paper, the localization problem is extended to the cases in which estimating the position of multi robots is considered. To do so, the joint prob
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540405344
COCOON
COCOON
A convex drawing of an n-vertex graph G = (V, E) is a drawing in which the vertices are placed on the corners of a convex n-gon in the plane and each edge is drawn using one straight line segment. We derive a general lower bound on the number of cros
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5938cf887e155ed7c14f3ffff5c50540
https://doi.org/10.1007/3-540-45071-8_49
https://doi.org/10.1007/3-540-45071-8_49
This volume contains papers selected for presentation at the 31st Annual C- ference on Current Trends in Theory and Practice of Informatics – SOFSEM 2005, held on January 22–28, 2005 in LiptovskyJ ´ an, ´ Slovakia. The series of SOFSEM conferen
Autor:
Ratislav Královic, Ondrej Sykora
This book constitutes the refereed proceedings of the 11th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2004, held in Smolenice Castle, Slowakia in June 2004. The 26 revised full papers presented were caref
Publikováno v:
Algorithmica. 2:251-265
We prove tight upper and lower bounds on the area of semi-elective, when-oblivious VLSI circuits for the problem of l-selection. The area required to select the l-th smallest of n k-bit numbers is found to be heavily dependent on the relative sizes o