Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
Reverse engineering has become a viable technique to create a 3D virtual model of an existing physical object. It enables the reconstruction of body surfaces to create a suitable C...
Gregory M. Lecrivain, Ian F. Kennedy, Arezki Slaou...
In Multi-Protocol Label Switching (MPLS) networks, traffic demands can be routed along tunnels called Label Switched Paths (LSPs). A tunnel is characterized by a path in the netwo...
Standard hidden Markov models (HMM's) have been studied extensively in the last two decades. It is well known that these models assume state conditional independence of the ob...
Grid computing intends to share heterogeneous resources in dynamic service-based environments. This kind of systems has the major advantages of enabling rapid composition of distr...