2 citations · 3 across the 5 of their papers we have counts for
4 papers
Small Proofs from Congruence Closure
Oliver Flatt, Samuel Coward, Max Willsey +2
Satisfiability Modulo Theory (SMT) solvers and equality saturation engines must generate proof certificates from e-graph-based congruence closure procedures to enable verification…
Automatic Generation of Complete Polynomial Interpolation Hardware Design Space
Bryce Orloski, Samuel Coward, Theo Drane
Hardware implementations of complex functions regularly deploy piecewise polynomial approximations. This work determines the complete design space of piecewise polynomial approxima…
Abstract Interpretation on E-Graphs
Samuel Coward, George A. Constantinides, Theo Drane
Recent e-graph applications have typically considered concrete semantics of expressions, where the notion of equivalence stems from concrete interpretation of expressions. However,…
Attention-Based Clustering: Learning a Kernel from Context
Samuel Coward, Erik Visse-Martindale, Chithrupa Ramesh
In machine learning, no data point stands alone. We believe that context is an underappreciated concept in many machine learning methods. We propose Attention-Based Clustering (ABC…