Campus Event Calendar: Edgar Ramos (06/27/2000 in MPII/024)

Campus Event Calendar

Campus Event Calendar:
- All Upcoming:
  - only for D1
  - only for D2
  - only for INET
  - only for D4
  - only for D5
  - only for D6
  - only for RG1
  - Mailing Lists
  - by Speaker
  - by Type
  - by Category
  - by Title
  - Calendar
  - RSS Feed
- History of Events:

Event Entry

New for: D1, D2, D4

What and Who

Polytope Approximation and Approximate Nearest Neighbor Queries

Edgar Ramos

Max-Planck-Institut für Informatik - AG 1

Lecture

AG 1, AG 2, AG 4

AG Audience

English

Note: We use this to send email in the morning.

Date, Time and Location

Tuesday, 27 June 2000

13:30

90 Minutes

MPII

024

Saarbrücken

Abstract

Based on a paper by K. Clarkson.

* Clarkson´s two Linear Programming algorithms
* Polytope Covering
* Linear Programming Queries
* Polytope Approximation
* A data structure for approximate NN queries

Contact

Edgar A. Ramos

--email hidden

System used:

Meeting URL:

Meeting ID:

Passcode:

passcode not visible

Code Visible for:

logged in users only

Imprint / Impressum | Data Protection / Datenschutzhinweis