Sciweavers

460 search results - page 23 / 92
» New Tools for Graph Coloring
Sort
View
FLAIRS
2004
13 years 9 months ago
A New Approach for Heterogeneous Hybridization of Constraint Satisfaction Search Algorithms
In the recent years, CSP's have come to be seen as the core problem in many applications. We propose here a hybrid algorithm (MC-FC) that combines two different search method...
Debasis Mitra, Hyoung-rae Kim
ICPR
2004
IEEE
14 years 8 months ago
Structural Graph Matching With Polynomial Bounds On Memory and on Worst-Case Effort
A new method of structural graph matching is introduced and compared against an existing method and against the maximum common subgraph. The method is approximate with polynomial ...
Fred W. DePiero
PAMI
2006
226views more  PAMI 2006»
13 years 7 months ago
Graph Partitioning Active Contours (GPAC) for Image Segmentation
In this paper we introduce new type of variational segmentation cost functions and associated active contour methods that are based on pairwise similarities or dissimilarities of t...
Baris Sumengen, B. S. Manjunath
IWPEC
2004
Springer
14 years 29 days ago
Online Problems, Pathwidth, and Persistence
Abstract. We explore the effects of using graph width metrics as restrictions on the input to online problems. It seems natural to suppose that, for graphs having some form of bou...
Rodney G. Downey, Catherine McCartin
ISLPED
2009
ACM
122views Hardware» more  ISLPED 2009»
14 years 2 months ago
Power-saving color transformation of mobile graphical user interfaces on OLED-based displays
Emerging organic light-emitting diode (OLED)-based displays have drastically different power consumption when displaying different colors, due to their emissive nature. They bring...
Mian Dong, Yung-Seok Kevin Choi, Lin Zhong