31 reputation
5
bio website netfiles.uiuc.edu/ahmadya2/…
location United States
age
visits member for 2 years, 8 months
seen Jul 16 at 19:30
Grad student at UIUC. I study applied formal and semi-formal verification of continuous and hybrid systems.

Sep
24
awarded  Autobiographer
Jul
16
awarded  Scholar
Jul
16
awarded  Supporter
Jul
16
accepted karhunen-Loeve expansion of Poisson process
Apr
5
comment n-dimensional voronoi diagram
I'm afraid it is as bad as Allessandro fears. The main problem is the number of the hyperplanes that these algorithm generates. For a very simple example, I used qhull for 40 points in 15-d and the voronoi decomposition has more than 5 million hyperplanes Voronoi diagram by the convex hull of 40 points in 16-d: Number of Voronoi regions: 40 Number of Voronoi vertices: 1361237 Statistics for: rbox 40 s D15 | qvoronoi s p TO test Number of points processed: 40 Number of hyperplanes created: 5539466 Number of facets in hull: 2774645 Number of distance tests for qhull: 4729150
May
16
revised An algorithm for checking if a nonlinear function f is always positive
added 25 characters in body
May
16
awarded  Editor
May
16
revised An algorithm for checking if a nonlinear function f is always positive
added 710 characters in body; added 7 characters in body; added 31 characters in body
May
16
asked An algorithm for checking if a nonlinear function f is always positive
May
4
asked karhunen-Loeve expansion of Poisson process
Feb
25
awarded  Student