1952 search results - page 188 / 391 » Complete partitions of graphs |
163
click to vote
RSP
2000
IEEE
15 years 11 months ago
2000
IEEE
This paper discusses the initial results of research into the development of a hardware/software co-design of the Java virtual machine. The design considers a complete Java virtua...
192
click to vote
ECCV
1998
Springer
15 years 10 months ago
1998
Springer
Region-based image segmentation techniques make use of similarity in intensity, color and texture to determine the partitioning of an image. The powerful cue of contour continuity ...
159
click to vote
ICWN
2004
15 years 8 months ago
2004
Abstract-- In this paper, we present a completely distributed algorithm for partitioning a given set of mobile nodes into clusters. The proposed algorithm tries to reduce the amoun...
169
click to vote
JCB
2000
15 years 6 months ago
2000
We present an implementation of McCaskill's algorithm for computing the base pair probabilities of an RNA molecule for massively parallel message passing architectures. The p...
194
click to vote
JCT
2010
15 years 5 months ago
2010
Abstract. A weighting of the edges of a graph is called vertexcoloring if the weighted degrees of the vertices yield a proper coloring of the graph. In this paper we show that such...