Concept

Objet initial et objet final

Publications associées (36)

Combinatorics of Loop Equations for Branched Covers of Sphere

We prove, in a purely combinatorial way, the spectral curve topological recursion for the problem of enumeration of bi-colored maps, which are dual objects to dessins d'enfant. Furthermore, we give a proof of the quantum spectral curve equation for this pr ...

OXFORD UNIV PRESS2018

Monotonic Prefix Consistency in Distributed Systems

Rachid Guerraoui, Jad Hamza, Dragos-Adrian Seredinschi

We study the issue of data consistency in distributed systems. Specifically, we consider a distributed system that replicates its data at multiple sites, which is prone to partitions, and which is assumed to be available (in the sense that queries are alwa ...

2018

Category Attentional Search for Fast Object Detection by Mimicking Human Visual Perception

Kwang Moo Yi

In this paper, we propose a novel selective search method to speed up the object detection via category-based attention scheme. The proposed attentional searching strategy is designed to focus on a small set of selected regions where the object category is ...

IEEE2015

Kan spectra, group spectra and twisting structures

Marc Stephan

Kan spectra provide a combinatorial model for the stable homotopy category. They were introduced by Dan Kan in 1963 under the name semisimplicial spectra. A Kan spectrum is similar to a pointed simplicial set, but it has simplices in negative degrees as we ...

EPFL2015

Obligatory averaging in mean size perception

Aire Raidvee

The perception of ensemble characteristics is often regarded as an antidote to an established bottleneck in focused attention and working memory, both of which appear to be limited in capacity to a few objects only. In order to test the associative law of ...

Elsevier2014

An Economic Model Predictive Control scheme with terminal penalty for continuous-time systems

Colin Neil Jones, Andrea Alessandretti

In this paper, convergence and performance properties of a sample-data continuous time model predictive control (MPC) scheme with economic performance index are developed. In particular, we provide sufficient conditions for convergence of the close loop st ...

2014

Parametrized K-theory

Nicolas Mathieu Michel

In nature, one observes that a K-theory of an object is defined in two steps. First a “structured” category is associated to the object. Second, a K-theory machine is applied to the latter category that produces an infinite loop space. We develop a general ...

2013

Method and apparatus for multiple object tracking with k-shortest paths

Pascal Fua, François Fleuret, Jérôme Berclaz

Trajectories of objects are estimated by determining the optimal solution(s) of a tracking model on the basis of an occupancy probability distribution. The occupancy probability distribution is the probability of presence of objects over a set of discrete ...

2013

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

A substantive contribution to a theory of spatial justice

Ana Moura Bastos de Fernandes Póvoas

The aim of my presentation is to communicate results of an exploratory stage of my research. I will briefly cover the research design, followed by a summary of the understandings of space that I use to structure the presentation. Then I will discuss some r ...

2013

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