6142 search results - page 565 / 1229 » The Complexity of Partition Functions |
172
click to vote
ESA
2007
Springer
16 years 1 months ago
2007
Springer
Given a graph G = (V, E), a (d, k)-coloring is a function from the vertices V to colors {1, 2, . . . , k} such that any two vertices within distance d of each other are assigned di...
184
click to vote
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
196
Voted
LADS
2007
Springer
16 years 1 months ago
2007
Springer
Embedded real-time systems play an important role in various application areas like plant automation, product automation or car electronics. In recent years a considerable growth i...
170
click to vote
VAMOS
2007
Springer
16 years 1 months ago
2007
Springer
The global telephone system is a complex transmission network, the features of which are defined to a very high level by ITU-T standards. It is therefore a prime candidate at whi...
187
click to vote
AVSS
2006
IEEE
16 years 1 months ago
2006
IEEE
This paper presents a novel method for illuminationinvariant and contrast preserving feature extraction, aimed at improving performance of tracking under complex light condition. ...