Sciweavers

152 search results - page 5 / 31
» Expected time analysis for Delaunay point location
Sort
View
DSVIS
2006
Springer
15 years 1 months ago
Analysis of Pointing Tasks on a White Board
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...
Giorgio P. Faconti, Mieke Massink
ICML
2010
IEEE
14 years 10 months ago
Gaussian Process Change Point Models
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...
Yunus Saatci, Ryan Turner, Carl Edward Rasmussen
ASWEC
2006
IEEE
15 years 3 months ago
An Empirically-Based Criterion for Determining the Success of an Open-Source Project
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...
Dror G. Feitelson, Gillian Z. Heller, Stephen R. S...
SODA
2004
ACM
127views Algorithms» more  SODA 2004»
14 years 11 months ago
An optimal randomized algorithm for maximum Tukey depth
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...
Timothy M. Chan
STOC
2003
ACM
153views Algorithms» more  STOC 2003»
15 years 9 months ago
Sublinear geometric algorithms
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...
Bernard Chazelle, Ding Liu, Avner Magen