Sciweavers

845 search results - page 5 / 169
» Diagnosabilities of regular networks
Sort
View
DAC
1996
ACM
13 years 12 months ago
Introspection: A Low Overhead Binding Technique During Self-Diagnosing Microarchitecture Synthesis
Abstract: Introspection, a zero-overhead binding technique during self-diagnosing microarchitecture synthesis is presented. Given a scheduled control data ow graph (CDFG) introspec...
Balakrishnan Iyer, Ramesh Karri
ICDCN
2009
Springer
14 years 2 months ago
Fault-Tolerant Implementations of Regular Registers by Safe Registers with Applications to Networks
We present the first wait-free and self-stabilizing implementation of a single-writer/single-reader regular register by single-writer/single-reader safe registers. The constructio...
Colette Johnen, Lisa Higham
BMCBI
2007
169views more  BMCBI 2007»
13 years 8 months ago
Transcriptional regulatory network refinement and quantification through kinetic modeling, gene expression microarray data and i
Background: Gene expression microarray and other multiplex data hold promise for addressing the challenges of cellular complexity, refined diagnoses and the discovery of well-targ...
Abdallah Sayyed-Ahmad, Kagan Tuncay, Peter J. Orto...
NN
2002
Springer
224views Neural Networks» more  NN 2002»
13 years 7 months ago
Optimal design of regularization term and regularization parameter by subspace information criterion
The problem of designing the regularization term and regularization parameter for linear regression models is discussed. Previously, we derived an approximation to the generalizat...
Masashi Sugiyama, Hidemitsu Ogawa
SPAA
2005
ACM
14 years 1 months ago
Peer-to-peer networks based on random transformations of connected regular undirected graphs
We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k +2 edges it interchanges the end vertices of the path. By defin...
Peter Mahlmann, Christian Schindelhauer