Algorithmic art

Humanities
Art
Visual arts
Painting

About
Privacy
Disclaimer

Graph Chatbot

Related publications (29)

Joint Graph-based Depth Refinement and Normal Estimation

Pascal Frossard, Mireille El Gheche, Mattia Rossi

Depth estimation is an essential component in understanding the 3D geometry of a scene, with numerous applications in urban and indoor settings. These scenes are characterized by a prevalence of human made structures, which in most of the cases, are either ...

2020

New Approaches to Artistic Synthesis Relying on Visual Perception

Mahmut Sami Arpa

Artists often take advantage of the limitations of the human visual system to create art that provides new experiences for the observers. Similarly, in this thesis, we explore new computational artistic compositions that create new visual experiences by re ...

EPFL2019

Lancet: A self-correcting Latency Measuring Tool

Edouard Bugnion, Evangelos Marios Kogias, Stephen Xin Mallon

We present LANCET, a self-correcting tool designed to measure the open-loop tail latency of µs-scale datacenter applications with high fan-in connection patterns. LANCET is self-correcting as it relies on online statistical tests to determine situations in ...

USENIX ASSOC2019

Efficient Relaxations for Dense CRFs with Sparse Higher-Order Potentials

Mathieu Salzmann

Dense conditional random fields (CRFs) have become a popular framework for modeling several problems in computer vision such as stereo correspondence and multiclass semantic segmentation. By modeling long-range interactions, dense CRFs provide a labeling t ...

SIAM PUBLICATIONS2019

Refutation-based synthesis in SMT

Viktor Kuncak, Andrew Joseph Reynolds

We introduce the first program synthesis engine implemented inside an SMT solver. We present an approach that extracts solution functions from unsatisfiability proofs of the negated form of synthesis conjectures. We also discuss novel counterexample-guided ...

SPRINGER2019

GOT: An Optimal Transport framework for Graph comparison

Pascal Frossard, Hermina Petric Maretic, Mireille El Gheche, Giovanni Chierchia

We present a novel framework based on optimal transport for the challenging problem of comparing graphs. Specifically, we exploit the probabilistic distribution of smooth graph signals defined with respect to the graph topology. This allows us to derive an ...

NEURAL INFORMATION PROCESSING SYSTEMS (NIPS)2019

SROBB: Targeted Perceptual Loss for Single Image Super-Resolution

Jean-Philippe Thiran, Mohammad Saeed Rad, Hazim Kemal Ekenel

By benefiting from perceptual losses, recent studies have improved significantly the performance of the super-resolution task, where a high-resolution image is resolved from its low-resolution counterpart. Although such objective functions generate near-ph ...

IEEE COMPUTER SOC2019

Functional Decomposition Using Majority

Giovanni De Micheli, Mathias Soeken, Zhufei Chu

Typical operators for the decomposition of Boolean functions in state-of-the-art algorithms are AND, exclusive-OR (XOR), and a 2-to-1 multiplexer (MUX). We propose a logic decomposition algorithm that uses the majority-of-three (MAJ) operation. Such decomp ...

IEEE2018

Indiscreet logarithms in finite fields of small characteristic

Robert Granger, Thorsten Kleinjung, Jens Markus Zumbrägel

Recently, several striking advances have taken place regarding the discrete logarithm problem (DLP) in finite fields of small characteristic, despite progress having remained essentially static for nearly thirty years, with the best known algorithms being ...

2018

Page 2 of 2