293 search results - page 7 / 59 » Across the Great Divide |
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
JMIV
2002
14 years 9 months ago
2002
An algorithm to suppress Gaussian noise is presented, based on clustering (grouping) gray levels. The histogram of a window sliding across the image is divided into clusters, and t...
ESWS
2008
Springer
14 years 11 months ago
2008
Springer
In this paper, we argue that implementing the grand vision of the Semantic Web would greatly benefit from a service which can enable the reuse of globally unique URIs across semant...
ICCAD
2007
IEEE
15 years 6 months ago
2007
IEEE
— We present a new linear time technique to compute criticality information in a timing graph by dividing it into “zones”. Errors in using tightness probabilities for critica...
HPCS
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract— Optimization of a similarity metric is an essential component in most medical image registration approaches based on image intensities. In this paper, two new, determin...