152 search results - page 5 / 31 » Expected time analysis for Delaunay point location |
DSVIS
2006
Springer
15 years 1 months ago
2006
Springer
We study the variations in two dimensional (2D) pointing tasks on a traditional white board of a group of subjects by means of capturing their movement traces in an automatic way w...
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
We combine Bayesian online change point detection with Gaussian processes to create a nonparametric time series model which can handle change points. The model can be used to loca...
ASWEC
2006
IEEE
15 years 3 months ago
2006
IEEE
In order to determine a success criterion for open-source software projects, we analyzed 122,205 projects in the SourceForge database. There were 80,597 projects with no downloads...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We present the first optimal algorithm to compute the maximum Tukey depth (also known as location or halfspace depth) for a non-degenerate point set in the plane. The algorithm is...
82
Voted
STOC
2003
ACM
15 years 9 months ago
2003
ACM
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...