455 search results - page 37 / 91 » A local approximation algorithm for maximum weight matching |
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
EMMCVPR
2009
Springer
15 years 4 months ago
2009
Springer
This article 3 presents a new adaptive texture model. Locally parallel oscillating patterns are modeled with a weighted Hilbert space defined over local Fourier coefficients. The ...
CPM
2005
Springer
14 years 11 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
NN
1998
Springer
14 years 9 months ago
1998
Springer
The relation between hard c-means (HCM), fuzzy c-means (FCM), fuzzy learning vector quantization (FLVQ), soft competition scheme (SCS) of Yair et al. (1992) and probabilistic Gaus...
JDA
2007
14 years 9 months ago
2007
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...