2314 search results - page 389 / 463 » Minimal Partitions of a Graph |
118
Voted
ICASSP
2010
IEEE
15 years 3 months ago
2010
IEEE
This paper addresses the problem of the interpolation of 2-d spherical signals from non-uniformly sampled and noisy data. We propose a graph-based regularization algorithm to impr...
122
click to vote
DAM
2008
15 years 3 months ago
2008
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
124
Voted
AUTOMATICA
2006
15 years 3 months ago
2006
In this paper a novel, Gibbs sampler-based algorithm is proposed for coordination of autonomous swarms. The swarm is modeled as a Markov random field (MRF) on a graph with a time-...
121
Voted
JCO
2008
15 years 3 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...
144
Voted
TVLSI
2008
15 years 3 months ago
2008
Abstract--In this paper, we introduce a novel substrate noise estimation technique during early floorplanning for mixed signal system-on-chip (SOC), based on block preference direc...