1208 search results - page 54 / 242 » On Counting Generalized Colorings |
DAC
2005
ACM
13 years 11 months ago
2005
ACM
This paper proposes a rapid and accurate evaluation scheme for cycle counts of a pipelined processor using evaluation reuse technique. Since exploration of an optimal processor is...
PODC
2010
ACM
13 years 11 months ago
2010
ACM
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
SIAMDM
2008
13 years 9 months ago
2008
We consider the class of graphs that contain no bull, no odd hole, and no antihole of length at least five. We present a new algorithm that colors optimally the vertices of every g...
CVPR
1997
IEEE
14 years 11 months ago
1997
IEEE
A general geometrical framework for image processing is presented. We consider intensity images as surfaces in the (x I) space. The image is thereby a two dimensional surface in t...
ICIP
2008
IEEE
14 years 10 months ago
2008
IEEE
A multiresolutional regularization method is proposed for local linear regression that regularizes local mean squared-error by the mean squared-error of a larger neighborhood. The...