5889 search results - page 340 / 1178 » Graph Layout Problems |
188
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
Abstract-- In this paper we consider the communication problem that involves transmission of correlated sources over broadcast channels. We consider a graph-based framework for thi...
219
click to vote
SIAMJO
2008
15 years 7 months ago
2008
Eigenvectors to the second smallest eigenvalue of the Laplace matrix of a graph, also known as Fiedler vectors, are the basic ingredient in spectral graph partitioning heuristics....
411
click to vote
PAMI
2010
15 years 5 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
206
click to vote
ICCAD
2003
IEEE
16 years 4 months ago
2003
IEEE
In the context of physical synthesis, large-scale standard-cell placement algorithms must facilitate incremental changes to layout, both local and global. In particular, flexible...
178
click to vote
SCOPES
2005
Springer
16 years 23 days ago
2005
Springer
Development of network communication in a homogeneous sensor network environment is straightforward as the nodes can share message layouts simply by letting the compiler lay out m...