OpenPifPaf: Composite Fields for Semantic Keypoint Detection and Spatio-Temporal Association
Publications associées (46)
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.
In this paper we present themethodological framework of a dynamic discrete-continuous choice model (DDCCM) of car ownership, usage and fuel type. The approach consists of embedding a discrete-continuous choice model into a dynamic programming (DP) framewor ...
In this paper we present the methodological framework of a dynamic discrete-continuous choice model (DDCCM) of car ownership, usage and fuel type. The approach consists of embedding a discrete-continuous choice model into a dynamic programming (DP) framewo ...
Autonomous vehicles can react faster than humans, they have more accurate perception and do not get distracted, sleepy or intoxicated. Autonomous vehicles could also increase the capacity of our current roads by allowing cars to be driven more closely to e ...
This paper introduces the concept of hybrid operational space control, a method that unifies kinematic tracking of individual joints with an inverse dynamics task space controller for the remainder of the robot. The proposed control strategy allows for a h ...
Two subsets of vertices in a graph are called homometric if the multisets of distances determined by them are the same. Let h(n) denote the largest number h such that any connected graph of n vertices contains two disjoint homometric subsets of size h. It ...
Detecting car taillights at night is a task which can nowadays be accomplished very fast on cheap hardware. We rely on such detections to build a vision-based system that, coupling them in a rule-based fashion, is able to detect and track vehicles. This al ...
Routing packets is a central function of multi-hop wireless networks. Traditionally, there have been two paradigms for routing, either based on the geographical coordinates of the nodes (geographic routing), or based on the connectivity graph (topology-bas ...
For several years road vehicle autonomous cruise control (ACC) systems as well as anti-collision radar have been developed. Several manufacturers currently sell this equipment. The current generation of ACC sensors only track the first preceding vehicle to ...
Parity (matching theory) and connectivity (network flows) are two main branches of combinatorial optimization. In an attempt to understand better their interrelation, we study a problem where both parity and connectivity requirements are imposed. The main ...
The vertex connectivity K of a graph is the smallest number of vertices whose deletion separates the graph or makes it trivial. We present the fastest known deterministic algorithm for finding the vertex connectivity and a corresponding separator. The time ...