1110 search results - page 96 / 222 » Clustering with the Connectivity Kernel |
ICCS
2003
Springer
14 years 2 months ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
Graphs are called navigable if one can find short paths through them using only local knowledge. It has been shown that for a graph to be navigable, its construction needs to mee...
CVIU
1999
13 years 8 months ago
1999
An important problem in computer vision is to determine how features extracted from images are connected to an existing model. In this paper, we focus on solving the registration ...
CORR
2011
Springer
13 years 25 days ago
2011
Springer
We initiate the study of sparse recovery problems under the Earth-Mover Distance (EMD). Specifically, we design a distribution over m × n matrices A such that for any x, given A...
SAINT
2009
IEEE
14 years 3 months ago
2009
IEEE
In this paper we present load balancing techniques for Cluster-based pub/sub framework that include both static and dynamic load balancing. The static load balancing is done throu...