Campus Event Calendar
Event Entry
What and Who
Fixed Dimensional Linear Programming Queries
Edgar Ramos
Course
AG 1, AG 2
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Tuesday, 17 August 99
13:30
60 Minutes
46
024
Saarbrücken
Abstract
Given a set a linear constraints in R^d, the problem is to design
a data structure that answers the optimal solution to a
given linear query function quickly. I will present work of
T.Chan (SoCG 1996) that gives a simple randomized approach, as an
alternative to previous work of J. Matousek (J. Alg. 1993).
Contact
Edgar A. Ramos
--email hidden
passcode not visible
logged in users only