Publications related to Parallelizing Maximal Clique Enumeration on Modern Manycore Processors

Related publications (8)

A 16-kB 65-nm GC-eDRAM Macro With Internal Bias Voltage Generation Providing Over 100-μs Retention Time

Gain-cell embedded dynamic random access memory (GC-eDRAM) has emerged as a suitable choice for embedded memory implementation due to its high density, low leakage current, and voltage scaling compatibility. This work presents a 16-kB 3T-1C GC-eDRAM macro, ...

2024

Continuous Test-time Domain Adaptation for Efficient Fault Detection under Evolving Operating Conditions

Olga Fink, Han Sun

Fault detection is crucial in industrial systems to prevent failures and optimize performance by distinguishing abnormal from normal operating conditions. Data-driven methods have been gaining popularity for fault detection tasks as the amount of condition ...

PHM Society2024

Better Boosting of Communication Oracles, or Not

Artur Riazanov, Nathaniel Idein Harms

Suppose we have a two-party communication protocol for f which allows the parties to make queries to an oracle computing g; for example, they may query an Equality oracle. To translate this protocol into a randomized protocol, we must replace the oracle wi ...

Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing2024

Depth-optimal Buffer and Splitter Insertion and Optimization in AQFP Circuits

Giovanni De Micheli, Alessandro Tempia Calvino

The Adiabatic Quantum-Flux Parametron (AQFP) is an energy-efficient superconducting logic family. AQFP technology requires buffer and splitting elements (B/S) to be inserted to satisfy path-balancing and fanout-branching constraints. B/S insertion policies ...

IEEE2023

Self-Aware Social Learning Over Graphs

Ali H. Sayed, Stefan Vlaski, Virginia Bordignon, Konstantinos Ntemos

In this paper we study the problem of social learning under multiple true hypotheses and self-interested agents that exchange information over a graph. In this setup, each agent receives data that might be generated from a different hypothesis (or state) t ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2023

Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz

Kilian Risse

We prove that polynomial calculus (and hence also Nullstellensatz) over any field requires linear degree to refute that sparse random regular graphs, as well as sparse Erdos-Renyi random graphs, are 3-colourable. Using the known relation between size and d ...

Ieee Computer Soc2023

A Taxonomy of Empathetic Questions in Social Dialogs

Pearl Pu Faltings, Kalpani Anuradha Welivita, Ekaterina Svikhnushina

Effective question-asking is a crucial component of a successful conversational chatbot. It could help the bots manifest empathy and render the interaction more engaging by demonstrating attention to the speaker's emotions. However, current dialog generati ...

ASSOC COMPUTATIONAL LINGUISTICS-ACL2022

Self-rule to multi-adapt: Generalized multi-source feature learning using unsupervised domain adaptation for colorectal cancer tissue detection

Jean-Philippe Thiran, Seyedbehzad Bozorgtabar, Christian Robert Abbet

Supervised learning is constrained by the availability of labeled data, which are especially expensive to acquire in the field of digital pathology. Making use of open-source data for pre-training or using domain adaptation can be a way to overcome this is ...

ELSEVIER2022