Home

Concept

Computer science

Formal sciences
Theoretical computer science
Theory of computation
Computational complexity th...

About
Privacy
Disclaimer

Graph Chatbot

Related publications (32)

On Semi-Algebraic Proofs and Algorithms

Mika Tapani Göös

We give a new characterization of the Sherali-Adams proof system, showing that there is a degree-d Sherali-Adams refutation of an unsatisfiable CNF formula C if and only if there is an ε > 0 and a degree-d conical junta J such that viol_C(x) - ε = J, where ...

Schloss Dagstuhl - Leibniz-Zentrum für Informatik2022

Engineering of Existing Structures: The Need and Place for Non-destructive Evaluation

Eugen Brühwiler, Numa Joy Bertola, Thomas Schumacher

Structural engineers today are still educated mainly to design new structures. This ignores the fact that structures already exist and need to be maintained. Students are thus often ill-equipped to deal with maintenance and preservation of existing structu ...

2022

A case for co-construction with teachers in curricular reform: Introducing computer science in primary school

Francesco Mondada, Helena Kovacs, Jessica Elke Dehler Zufferey, Laila Abdelsalam El-Hamamsy, Barbara Bruno

With the introduction of Computer Science (CS) into curricula worldwide, researchers have investigated whether CS could be introduced transversally, as a support other disciplines. Few however consider both student learning and the teachers’ perspective in ...

ACM2022

Streaming and Matching Problems with Submodular Functions

Paritosh Garg

Submodular functions are a widely studied topic in theoretical computer science. They have found several applications both theoretical and practical in the fields of economics, combinatorial optimization and machine learning. More recently, there have also ...

EPFL2022

Promoting Computational Thinking Skills in Non-Computer Science Students Gamifying Computational Notebooks to Increase Student Engagement

Denis Gillet, Juan Carlos Farah, Adrian Christian Holzer, Marc Lafuente Martinez, Pascal Felber

Computational thinking (CT) skills are becoming increasingly relevant for future professionals across all domains, beyond computer science (CS). As such, an increasing number of bachelor and masters programs outside of the computer science discipline integ ...

2022

Faster One-Sample Stochastic Conditional Gradient Method for Composite Convex Minimization

Volkan Cevher, Alp Yurtsever, Maria-Luiza Vladarean

We propose a stochastic conditional gradient method (CGM) for minimizing convex finitesum objectives formed as a sum of smooth and non-smooth terms. Existing CGM variants for this template either suffer from slow convergence rates, or require carefully inc ...

2022

Learning to Represent and Reconstruct 3D Deformable Objects

Jan Bednarík

Representing and reconstructing 3D deformable shapes are two tightly linked problems that have long been studied within the computer vision field. Deformable shapes are truly ubiquitous in the real world, whether be it specific object classes such as human ...

EPFL2022

STEPS 4.0: Fast and memory-efficient molecular simulations of neurons at the nanoscale

Felix Schürmann, James Gonzalo King, Pramod Shivaji Kumbhar, Omar Awile, Christos Kotsalos, Tristan Mathieu Carel, Iain Hepburn, Samuel Marie A Melchior, Weiliang Chen, Baudouin Paul Michel Maria Joseph Del Marmol, Alessandro Cattabiani, Giacomo Castiglioni, Nicola Cantarutti

Recent advances in computational neuroscience have demonstrated the usefulness and importance of stochastic, spatial reaction-diffusion simulations. However, ever increasing model complexity renders traditional serial solvers, as well as naive parallel imp ...

FRONTIERS MEDIA SA2022

Text as signal. A tutorial with case studies focusing on social media (Twitter)

Erick Jorge Canales Rodriguez

Sentiment analysis is the automated coding of emotions expressed in text. Sentiment analysis and other types of analyses focusing on the automatic coding of textual documents are increasingly popular in psychology and computer science. However, the potenti ...

SPRINGER2022

Relaxed Locally Correctable Codes With Nearly-Linear Block Length And Constant Query Complexity

Alessandro Chiesa

Locally correctable codes (LCCs) are error correcting codes C : \Sigmak \rightarrow \Sigman which admit local algorithms that correct any individual symbol of a corrupted codeword via a minuscule number of queries. For systematic codes, this notion is stro ...

SIAM PUBLICATIONS2022

Online Dating Quantification Practices: A Human-Machine Learning Process

Jessica Carolina Pidoux

The phenomenon of online dating via web and mobile phone applications involves several actors: graphical interfaces, developers, algorithmic systems for user matching, and users. These actors have been studied in parallel by the social sciences and by comp ...

EPFL2021

Exploring a Handwriting Programming Language for Educational Robots

Francesco Mondada, Taavet Kangur, Barbara Bruno, Laila Abdelsalam El-Hamamsy, Christian Giang, Vaios Papaspyros, Laura Mathex

Recently, introducing computer science and educational robots in compulsory education has received increasing attention. However, the use of screens in classrooms is often met with resistance, especially in primary school. To address this issue, this study ...

Springer, Cham2021

Page 2 of 2