1951 search results - page 116 / 391 » An algorithm for improving graph partitions |
129
click to vote
MFCS
2007
Springer
15 years 10 months ago
2007
Springer
The notion of distance constrained graph labelings, motivated by the Frequency Assignment Problem, reads as follows: A mapping from the vertex set of a graph G = (V, E) into an in...
119
click to vote
FLAIRS
2003
15 years 5 months ago
2003
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to a set of constraints. While solving a CSP is an ...
130
click to vote
ICIP
2007
IEEE
15 years 10 months ago
2007
IEEE
The geometric features of images, such as edges, are difficult to represent. When a redundant transform is used for their extraction, the compression challenge is even more dif...
132
click to vote
DAC
1999
ACM
16 years 5 months ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
127
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
We derive lower bounds on the convergence speed of a widely used class of distributed averaging algorithms. In particular, we prove that any distributed averaging algorithm whose ...