Concept

Set-builder notation

Publications associées (335)

Monochromatic empty triangles in two-colored point sets

Improving a result of Aichholzer et al., we show that there exists a constant c > 0 satisfying the following condition. Any two-colored set of n points in general position in the plane has at least cn(4/3) triples of the same color such that the triangles ...

Elsevier Science Bv2013

Advantageous State Merging During Symbolic Analysis

George Candea, Johannes Kinder, Volodymyr Kuznetsov, Stefan Bucur

A determination is made regarding whether to merge two symbolic analysis states. A first state corresponds to a first path through a program to a program location and a second state corresponds to a second path through the program to the program location. ...

2013

Chiese provvisorie. Identità sospesa

Chiara Monterumisi

This book is the result of a choral participation (School of Doctorate Studies in Architecture, University of Bologna and Laboratorio “Ricerca Emilia”) in the exhibition entitled “Architetture padane”. It is also the second step of wider investigation focu ...

CLUEB2013

A Distributed Polling with Probabilistic Privacy

Rachid Guerraoui, Florian Huc, Yahya Benkaouz

In this paper, we present PDP, a distributed polling protocol that enables a set of participants to gather their opinion on a common interest without revealing their point of view. PDP does not rely on any centralized authority or on heavyweight cryptograp ...

2013

Analysis of shear-transfer actions on one-way RC members based on measured cracking pattern and failure kinematics

Aurelio Muttoni, Miguel Fernández Ruiz, Stefano Campana, Andrea Anastasi

Shear in one-way reinforced concrete (RC) members is transferred in cracked concrete members by a number of actions such as aggregate interlock, residual tensile stresses, dowelling action, inclination of compression chord and transverse reinforcement (if ...

Magazine of Concrete Research2013

The Visible Perimeter of an Arrangement of Disks

János Pach, Gábor Tardos, Gabriel Nivasch

Given a collection of n opaque unit disks in the plane, we want to find a stacking order for them that maximizes their visible perimeter, the total length of all pieces of their boundaries visible from above. We prove that if the centers of the disks form ...

Springer2013

Launch Hard or Go Home! Predicting the Success of Kickstarter Campaigns

Patrick Thiran, Matthias Grossglauser, Vincent Etter

Crowdfunding websites such as Kickstarter are becoming increasingly popular, allowing project creators to raise hundreds of millions of dollars every year. However, only one out of two Kickstarter campaigns reaches its funding goal and is successful. It is ...

ACM2013

Mirror Match: Reliable Feature Point Matching Without Geometric Constraints

Sabine Süsstrunk, Stefan Winkler

Many algorithms have been proposed to solve the problem of matching feature points in two or more images using geometric assumptions to increase the robustness of the matching. However, these assumptions do not always hold; in particular, few methods addre ...

2013

On the evaluation of 3D codecs on multiview autostereoscopic display

Touradj Ebrahimi, Philippe Hanhart

Evaluating the performance of different 3D codecs on multiview autostereoscopic monitor is a tedious process, as it requires the synthesis of a dense set of views. Therefore, it is legitimate to ask if evaluations could be performed on stereoscopic monitor ...

2013

A transcript perspective on evolution

Bernard Moret, Yann Christinat

Alternative splicing is now recognized as a major mechanism for transcriptome and proteome diversity in higher eukaryotes, yet its evolution is poorly understood. Most studies focus on the evolution of exons and introns at the gene level, while only few co ...

Ieee Computer Soc2013

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search