Canal-U

Mon compte

Résultats de recherche

Nombre de programmes trouvés : 161
Conférences

le (1h55s)

Concurrent Disjoint Set Union

The disjoint set union problem is a classical problem in data structures with a simple and efficient sequential solution that has a notoriously complicated analysis. One application is to find strongly connected components in huge, implicitly defined graphs arising in model checking. In this application, the use of multiprocessors has the potential to produce significant speedups. We explore this possibility. We devise and analyze concurrent versions of standard sequential algorithms that use single and double compare-and-swap primitives for synchronization, making ...
Voir la vidéo
Conférences

le (1h8m48s)

On Artificial Olfaction, and How to Test For It

For years there has been interest in the possibility of building a reliable odor reproduction system (AOS), with its vast spectrum of applications: from e-commerce, games and video, via the food and cosmetics industry, to medical diagnosis. Such a system would enable an output device — the whiffer — to release an imitation of an odor read in by an input device — the sniffer — upon command. To realize this scheme one must carry out deep and complex research that combines computer science and mathematics ...
Voir la vidéo
Conférences

le (1h26m58s)

Le Bitcoin et les monnaies cryptographiques

En 2008 une nouvelle façon de concevoir la monnaie a été proposée, qui remet en cause les anciennes idées sur cette institution. Comme pour le courrier électronique ou internet qui ne sont aux mains d’aucune autorité et conduisent donc à une meilleure appropriation de l’information par tous, et à des pratiques démocratiques nouvelles de communication entre citoyens, il semble que, dans le domaine monétaire, tout pourrait fonctionner sans autorité centrale de contrôle. Le « bitcoin » est la première version de ce nouveau type de monnaies numériques. Il est fondé sur l’utilisation d’un réseau P2P et de ...
Voir la vidéo
Conférences

le (1h9m46s)

Towards the Expressive Design of Virtual Worlds: Combining Knowledge and Control

Despite our great expressive skills, we humans lack an easy way of conveying the 3D worlds we imagine. While impressive advances were made in the last fifteen years to evolve digital modeling systems into gesture-based interfaces enabling to sketch or sculpt in 3D, modeling is still generally limited to the design of isolated, static shapes. In contrast, virtual worlds are composed of distributions or assemblies of elements which are too numerous to be created or even positioned one by one; the shapes of these elements may ...
Voir la vidéo
Conférences

le (1h2m59s)

Decision making at scale: Algorithms, Mechanisms, and Platforms

YouTube competes with Hollywood as an entertainment channel, and also supplements Hollywood by acting as a distribution mechanism. Twitter has a similar relationship to news media, and Coursera to Universities. But there are no online alternatives for making democratic decisions at large scale as a society. In this talk, we will describe two algorithmic approaches towards large scale decision making that we are exploring. a) Knapsack voting and participatory budgeting: All budget problems are knapsack problems at their heart, since the goal is ...
Voir la vidéo
Conférences

le (1h9m15s)

Number-theoretic methods in quantum computing

An important problem in quantum computing is the so-called approximate synthesis problem: to find a quantum circuit, preferably as short as possible, that approximates a given unitary operator up to given epsilon. Moreover, the solution should be computed by an efficient algorithm. For nearly two decades, the standard solution to this problem was the Solovay-Kitaev algorithm, which is based on geometric ideas. This algorithm produces circuits of size O(log^c(1/epsilon)), where c is approximately 3.97. It was a long-standing open problem whether this exponent ...
Voir la vidéo

 
FMSH
 
Facebook Twitter Google+
Mon Compte