221 search results - page 9 / 45 » Twinkle: programming with color |
165
click to vote
Source Code
This is the sample implementation of a Markov random field based color image segmentation algorithm described in the following paper:
Zoltan Kato, Ting Chuen Pong, and John Chu...
ICALP
2007
Springer
15 years 4 months ago
2007
Springer
We study the problem of finding occurrences of motifs in vertex-colored graphs, where a motif is a multiset of colors, and an occurrence of a motif is a subset of connected vertic...
ISCA
2010
IEEE
15 years 3 months ago
2010
IEEE
In this paper, we propose ColorSafe, an architecture that detects and dynamically avoids single- and multi-variable atomicity violation bugs. The key idea is to group related data...
DAC
1999
ACM
15 years 11 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...
ICALP
2001
Springer
15 years 2 months ago
2001
Springer
In this paper we initiate the study of testing properties of hypergraphs. The goal of property testing is to distinguish between the case whether a given object has a certain prope...