307 search results - page 2 / 62 » A Comparison of Algorithms for Connected Set Openings and Cl... |
MOBIHOC
2002
ACM
14 years 5 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
GECCO
2007
Springer
13 years 12 months ago
2007
Springer
In this paper, we describe an experiment to evolve oral tract (mouth) shapes for a set of vowels for two adult males. Target vowels were recorded in an acoustically anechoic room ...
DAGM
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. Graphical models with higher order factors are an important tool for pattern recognition that has recently attracted considerable attention. Inference based on such model...
JCO
2008
13 years 5 months ago
2008
We study Connected Facility Location problems. We are given a connected graph G = (V, E) with nonnegative edge cost ce for each edge e E, a set of clients D V such that each cli...
ICIP
2001
IEEE
14 years 7 months ago
2001
IEEE
In this paper, generalized granulometric size distributions and size histograms (a.k.a `pattern spectra') are developed using generalized multiscale lattice operators of the ...