2188 search results - page 78 / 438 » Instance-Optimal Geometric Algorithms |
148
click to vote
DIALM
2008
ACM
15 years 4 months ago
2008
ACM
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
105
click to vote
MICCAI
2004
Springer
16 years 3 months ago
2004
Springer
Abstract. Often in neurosurgical planning a dual spin echo acquisition is performed that yields proton density (PD) and T2-weighted images to evaluate edema near a tumor or lesion....
203
click to vote
ICDE
2007
IEEE
16 years 3 months ago
2007
IEEE
Skyline query processing has been investigated extensively in recent years, mostly for only one query reference point. An example of a single-source skyline query is to find hotel...
129
click to vote
CVPR
2012
IEEE
13 years 4 months ago
2012
IEEE
We address the problem of unsupervised segmentation and grouping in 2D and 3D space, where samples are corrupted by noise, and in the presence of outliers. The problem has attract...
130
click to vote
SODA
1992
ACM
15 years 3 months ago
1992
ACM
We present several applications in computational geometry of Megiddo's parametric searching technique. These applications include: (1) Finding the minimum Hausdorff distance ...