Sciweavers

14 search results - page 1 / 3
» On Induced Matching Partitions of Certain Interconnection Ne...
Sort
View
FCS
2006
13 years 6 months ago
On Induced Matching Partitions of Certain Interconnection Networks
Paul Manuel, Indra Rajasingh, Bharati Rajan, Alber...
JGT
2006
60views more  JGT 2006»
13 years 4 months ago
Spanning subgraphs of graphs partitioned into two isomorphic pieces
: A graph has the neighbor-closed-co-neighbor, or ncc property, if for each of its vertices x, the subgraph induced by the neighbor set of x is isomorphic to the subgraph induced b...
Anthony Bonato
FPGA
2008
ACM
161views FPGA» more  FPGA 2008»
13 years 6 months ago
Implementing high-speed string matching hardware for network intrusion detection systems
This paper presents high-throughput techniques for implementing FSM based string matching hardware on FPGAs. By taking advantage of the fact that string matching operations for di...
Atul Mahajan, Benfano Soewito, Sai K. Parsi, Ning ...
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 3 months ago
On weakly optimal partitions in modular networks
Abstract. Modularity was introduced as a measure of goodness for the community structure induced by a partition of the set of vertices in a graph. Then, it also became an objective...
José Ignacio Alvarez-Hamelin, Beiró ...
CCGRID
2001
IEEE
13 years 8 months ago
An Adaptive, Reconfigurable Interconnect for Computational Clusters
This paper describes the principles of an original adaptive interconnect for a computational cluster. Torus topology (2d or 3d) is used as a basis but nodes are allowed to effecti...
Alexander V. Shafarenko, Vladimir Vasekin