Computing with Reads and Writes in the Absence of Step Contention

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

During the Artificial Intelligence (AI) revolution of the past decades, deep neural networks have been widely used and have achieved tremendous success in visual recognition. Unfortunately, deploying deep models is challenging because of their huge model s ...

In this article, I discuss the process of designing an object to protest against a specific surveillance device: the IMSI catcher, a controversial object used to monitor GSM networks. Being widely used in protests, I develop a tactical approach based on ob ...

Information about a moving object is usually poor at each retinotopic location because photoreceptor activation is short, noisy, and affected by shadows, reflections of other objects, and so on. Integration across the motion trajectory may yield a much bet ...

Recent successes in the reuse and rehabilitation of 20th century architecture have shown that design begins with the study of history. Study of the material history of built structures, together with historical and critical investigation, supported by diag ...

Despite the recent advances in multiple object tracking (MOT), achieved by joint detection and tracking, dealing with long occlusions remains a challenge. This is due to the fact that such techniques tend to ignore the long-term motion information. In this ...

This paper reports on the computation of a discrete logarithm in the finite field F-230750, breaking by a large margin the previous record, which was set in January 2014 by a computation in F-29234. The present computation made essential use of the elimina ...

In concurrent systems without automatic garbage collection, it is challenging to determine when it is safe to reclaim memory, especially for lock-free data structures. Existing concurrent memory reclamation schemes are either fast but do not tolerate proce ...

Database engines face growing scalability challenges as core counts exponentially increase each processor generation, and the efficiency of synchronization primitives used to protect internal data structures is a crucial factor in overall database performa ...

Instruction-cache misses account for up to 40%; of execution time in online transaction processing (OLTP) database workloads. In contrast to data cache misses, instruction misses cannot be overlapped with out-of-order execution. Chip design limitations do ...

Computing with Reads and Writes in the Absence of Step Contention

Chat with Graph Search

Improving the Training of Compact Neural Networks for Visual Recognition

Catch Me If You Can Designing a Disobedient Object to Protest Against GSM Surveillance

Features integrate along a motion trajectory when object integrity is preserved

Concerning the research “Material history of the built environment and the conservation project” (2008–2020), methodology and results

Concerning the research “Material history of the built environment and the conservation project” (2008–2020), methodology and results

Probabilistic Tracklet Scoring and Inpainting for Multiple Object Tracking

Computation Of A 30750-Bit Binary Field Discrete Logarithm

Fast and Robust Memory Reclamation for Concurrent Data Structures

A New Look at the Roles of Spinning and Blocking

Improving instruction cache performance in OLTP