Sciweavers

4679 search results - page 28 / 936
» Modeling When Connections Are the Problem
Sort
View
EUROPAR
2004
Springer
15 years 3 months ago
A Coarse-Grained Parallel Algorithm for Spanning Tree and Connected Components
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...
Edson Norberto Cáceres, Frank K. H. A. Dehn...
ICONIP
2004
14 years 11 months ago
A Neural Network Model for Trace Conditioning
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...
Tadashi Yamazaki, Shigeru Tanaka
COR
2007
183views more  COR 2007»
14 years 9 months ago
Arcs-states models for the vehicle routing problem with time windows and related problems
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...
Thierry Mautor, Edith Naudin
ISCIS
2005
Springer
15 years 3 months ago
A Unified Approach to Survivability of Connection-Oriented Networks
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 ...
Krzysztof Walkowiak
ICPR
2008
IEEE
15 years 4 months ago
Face super-resolution using 8-connected Markov Random Fields with embedded prior
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, ...