371 search results - page 20 / 75 » Algorithms for the transportation problem in geometric setti... |
CPM
2000
Springer
14 years 2 days ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
SODA
1992
ACM
13 years 9 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 ...
PPL
2006
13 years 7 months ago
2006
A new computational paradigm is described which o ers the possibility of superlinear and sometimes unbounded speedup, when parallel computation is used. The computations involved ...
CMPB
2010
13 years 7 months ago
2010
Recent advances in 4D imaging and real-time imaging provide image data with clinically important cardiac dynamic information at high spatial or temporal resolution. However, the en...
TSMC
2008
13 years 7 months ago
2008
We present a method for the recovery of partially occluded 3D geometric primitives from range images which might also include non-primitive objects. The method uses a technique for...