Sciweavers

11381 search results - page 9 / 2277
» Connectivity
Sort
View
CADE
2005
Springer
15 years 10 months ago
Connecting Many-Sorted Theories
Abstract. Basically, the connection of two many-sorted theories is obtained by taking their disjoint union, and then connecting the two parts through connection functions that must...
Franz Baader, Silvio Ghilardi
CONNECTION
2006
101views more  CONNECTION 2006»
14 years 9 months ago
High capacity, small world associative memory models
Models of associative memory usually have full connectivity or if diluted, random symmetric connectivity. In contrast, biological neural systems have predominantly local, non-symm...
Neil Davey, Lee Calcraft, Rod Adams
WADS
2007
Springer
91views Algorithms» more  WADS 2007»
15 years 3 months ago
Kernelization and Complexity Results for Connectivity Augmentation Problems
Connectivity augmentation problems ask for adding a set of at most k edges whose insertion makes a given graph satisfy a specified connectivity property, such as bridge-connectivi...
Jiong Guo, Johannes Uhlmann
ICMCS
2006
IEEE
120views Multimedia» more  ICMCS 2006»
15 years 3 months ago
Modeling and Performance Analysis of Initial Connection in IEEE 802.16 PMP Networks
In this paper, we propose an accurate analytical model to analyze the performance of initial ranging requests in IEEE 802.16 networks. Two metrics, connection probability and aver...
Lidong Lin, Bo Han, Weijia Jia
CONNECTION
2007
87views more  CONNECTION 2007»
14 years 9 months ago
Efficient architectures for sparsely-connected high capacity associative memory models
In physical implementations of associative memory, wiring costs play a significant role in shaping patterns of connectivity. In this study of sparsely-connected associative memory...
Lee Calcraft, Rod Adams, Neil Davey