Sciweavers

60 search results - page 7 / 12
» On Packing Colorings of Distance Graphs
Sort
View
COR
2010
146views more  COR 2010»
13 years 7 months ago
A search space "cartography" for guiding graph coloring heuristics
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
ATMOS
2007
119views Optimization» more  ATMOS 2007»
13 years 9 months ago
Models for Railway Track Allocation
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...
Ralf Borndörfer, Thomas Schlechte
POPL
2003
ACM
14 years 7 months ago
Bitwidth aware global register allocation
Multimedia and network processing applications make extensive use of subword data. Since registers are capable of holding a full data word, when a subword variable is assigned a r...
Sriraman Tallam, Rajiv Gupta
ICIAP
2003
ACM
14 years 17 days ago
Color matching by using tuple matching
In this paper we present a new matching method called Tuple Matching (TM), which is an algorithm for matching of signatures. Since signatures can contain arbitrary features like c...
Dirk Balthasar
ICIP
2009
IEEE
13 years 5 months ago
Graph-based foreground extraction in extended color space
We propose a region-based method to extract semantic foreground regions from color video sequences with static backgrounds. First, we introduce a new distance measure for backgrou...
Hansung Kim, Adrian Hilton