321 search results - page 16 / 65 » Partitioning by iterative deletion |
SIAMCOMP
1998
13 years 9 months ago
1998
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
EUC
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Embedded systems have strict timing and code size requirements. Retiming is one of the most important optimization techniques to improve the execution time of loops by in...
ACCV
2009
Springer
14 years 4 months ago
2009
Springer
Graph cuts based interactive segmentation has become very popular over the last decade. In standard graph cuts, the extraction of foreground object in a complex background often le...
AUTOMATICA
2006
13 years 10 months ago
2006
This paper revisits a well-known synthesis problem in iterative learning control, where the objective is to optimize a performance criterion over a class of causal iterations. The...
BMCBI
2004
13 years 10 months ago
2004
Background: Clustering is one of the most commonly used methods for discovering hidden structure in microarray gene expression data. Most current methods for clustering samples ar...