4171 search results - page 310 / 835 » Choice numbers of graphs |
201
click to vote
3DPVT
2006
IEEE
16 years 27 days ago
2006
IEEE
In this paper we propose a novel framework for efficiently extracting foreground objects in so called shortbaseline image sequences. We apply the obtained segmentation to improve...
178
click to vote
ICPADS
2006
IEEE
16 years 26 days ago
2006
IEEE
While most parallel task graphs scheduling research has been done in the context of single homogeneous clusters, heterogeneous platforms have become prevalent and are extremely at...
175
click to vote
CP
2005
Springer
16 years 11 days ago
2005
Springer
Abstract. In an increasing number of domains such as bioinformatics, combinatorial graph problems arise. We propose a novel way to solve these problems, mainly those that can be tr...
215
click to vote
PPSWR
2005
Springer
16 years 9 days ago
2005
Springer
Metadata processing is recognized as a central challenge for database research in the next decade. Already, novel desktop data management and search applications (cf. Apple’s Spo...
184
click to vote
TAMC
2010
Springer
15 years 12 months ago
2010
Springer
Incrementally k-list coloring a graph means that a graph is given by adding stepwise one vertex after another, and for each intermediate step we ask for a vertex coloring such that...