Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
We studied the dynamics of a neural network which have both of recurrent excitatory and random inhibitory connections. Neurons started to become active when a relatively weak trans...
This paper presents several Arcs-States models that can be applied to numerous vehicle routing problems, one of which is the well-known vehicle routing problem with capacities and...
This paper deals with problems of computer networks survivability. We present and discuss survivability aspects of Content Delivery Networks (CDNs) and other services based on the ...
In patch based face super-resolution method, the patch size is usually very small, and neighbor patches’ relationship via overlapped regions is only to keep smoothness of recons...
Kai Guo, Xiaokang Yang, Rui Zhang, Guangtao Zhai, ...