616 search results - page 84 / 124 » Minimum Spanning Tree Based Clustering Algorithms |
SIAMCOMP
1998
13 years 7 months ago
1998
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
ASIACRYPT
2003
Springer
14 years 25 days ago
2003
Springer
We present two new parallel algorithms for extending the domain of a UOWHF. The first algorithm is complete binary tree based construction and has less key length expansion than S...
ISVC
2010
Springer
13 years 6 months ago
2010
Springer
Interpolating diffusion tensor fields is a key technique to visualize the continuous behaviors of biological tissues such as nerves and muscle fibers. However, this has been stil...
DAC
2006
ACM
14 years 8 months ago
2006
ACM
Traditionally, rectilinear Steiner minimum trees (RSMT) are widely used for routing estimation in design optimizations like floorplanning and physical synthesis. Since it optimize...
TSP
2010
13 years 2 months ago
2010
In this paper, we consider a low-complexity detection technique referred to as a reduced dimension maximum-likelihood search (RD-MLS). RD-MLS is based on a partitioned search which...