Publications by François Fleuret

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Fast K-Means with Accurate Bounds

François Fleuret, James Peter Newling

We propose a novel accelerated exact

k

-means algorithm, which outperforms the current state-of-the-art low-dimensional algorithm in 18 of 22 experiments, running up to 3

\times

faster. We also propose a general improvement of existing state-of-the-art a ...

Idiap2016

François Fleuret

Graph Chatbot

Chat with Graph Search

Scalable Metric Learning via Weighted Approximate Rank Component Analysis

Measurement of the forward Z boson production cross-section in pp collisions at root s=13 TeV

Fast K-Means with Accurate Bounds

Tracking Interacting Objects Using Intertwined Flows

Kullback-Leibler Proximal Variational Inference

Systems and methods for tracking interacting objects

Adaptive Sampling for Large Scale Boosting

Sample Distillation for Object Detection and Image Classification

Efficient Sample Mining for Object Detection

Re-Identification for Improved People Tracking

Kullback-Leibler Proximal Variational Inference

Tracking Interacting Objects Using Intertwined Flows

Systems and methods for tracking interacting objects

Sample Distillation for Object Detection and Image Classification

Efficient Sample Mining for Object Detection

Re-Identification for Improved People Tracking

Measurement of the forward Z boson production cross-section in pp collisions at root s=13 TeV

Scalable Metric Learning via Weighted Approximate Rank Component Analysis

Adaptive Sampling for Large Scale Boosting

Fast K-Means with Accurate Bounds