562 search results - page 86 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
SDM
2009
SIAM
14 years 5 months ago
2009
SIAM
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
ESA
2004
Springer
14 years 1 months ago
2004
Springer
The task of balancing dynamically generated work load occurs in a wide range of parallel and distributed applications. Diffusion based schemes, which belong to the class of nearest...
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
This paper presents robust click-point linking: a novel localized registration framework that allows users to interactively prescribe where the accuracy has to be high. By emphasi...
JMLR
2008
13 years 8 months ago
2008
The max-sum classifier predicts n-tuple of labels from n-tuple of observable variables by maximizing a sum of quality functions defined over neighbouring pairs of labels and obser...
CCECE
2009
IEEE
14 years 3 months ago
2009
IEEE
The inverse diffusion problems deal with the estimation of many crucial parameters such as the diffusion coefficient, source properties, and boundary conditions. Such algorithms ...