: In a recent result, Khot and Saket [FOCS 2014] proved the quasi-NP-hardness of coloring a 2-colorable 12-uniform hypergraph with 2(logn)Ω(1) colors. This result was proved usin...
Abstract: Bourgain and Yehudayoff recently constructed O(1)-monotone bipartite expanders. By combining this result with a generalisation of the unraveling method of Kannan, we cons...
Vida Dujmovic, Anastasios Sidiropoulos, David R. W...
Abstract. The minimum spanning tree (MST) construction is a classical problem in Distributed Computing for creating a globally minimized structure distributedly. Self-stabilization...
One of the challenges of using brain-computer interfaces (BCIs) over extended periods of time is the variation of the users’ performance from one experimental day to another. The...
Sareh Saeedi, Ricardo Chavarriaga, Robert Leeb, Jo...
Abstract— As various non-volatile memory (NVM) technologies have been adopted in different levels of memory hierarchy, the security issue of protecting information retained in NV...
Reconfigurable radio frequency (RF) system has emerged as a promising avenue to achieve high communication performance while adapting to versatile commercial wireless environment....
Fa Wang, Shihui Yin, Minhee Jun, Xin Li 0001, Tama...
— Clock distribution networks (CDNs) are costly in high-performance ASICs. This paper proposes a new approach: splitting clock domains at a very fine level, down to the level of...
M. Hassan Najafi, David J. Lilja, Marc D. Riedel, ...
Effective layout pattern sampling is a fundamental component for lithography process optimization, hotspot detection, and model calibration. Existing pattern sampling algorithms r...
Abstract—We study the logic synthesis of emerging nanotechwhose elementary devices abstraction is a majority voter. We argue that synthesis tools, natively supporting the majorit...