Sciweavers

49 search results - page 9 / 10
» Lower bounds for expected-case planar point location
Sort
View
FOCS
2009
IEEE
14 years 2 months ago
Instance-Optimal Geometric Algorithms
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
Peyman Afshani, Jérémy Barbay, Timot...
CVPR
2008
IEEE
14 years 9 months ago
Characterizing the shadow space of camera-light pairs
We present a theoretical analysis for characterizing the shadows cast by a point light source given its relative position to the camera. In particular, we analyze the epipolar geo...
Daniel A. Vaquero, Matthew Turk, Ramesh Raskar, Ro...
MP
2010
128views more  MP 2010»
13 years 6 months ago
Perspective reformulations of mixed integer nonlinear programs with indicator variables
Abstract. We study mixed integer nonlinear programs (MINLP)s that are driven by a collection of indicator variables where each indicator variable controls a subset of the decision ...
Oktay Günlük, Jeff Linderoth
VIS
2004
IEEE
222views Visualization» more  VIS 2004»
14 years 9 months ago
Non-Linear Model Fitting to Parameterize Diseased Blood Vessels
Accurate estimation of vessel parameters is a prerequisite for automated visualization and analysis of healthy and diseased blood vessels. The objective of this research is to est...
Alexandra La Cruz, Matús Straka, Arnold K&o...
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
14 years 5 months ago
Differentially Private Approximation Algorithms
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...