Sciweavers

336 search results - page 23 / 68
» Approximating Transitivity in Directed Networks
Sort
View
BIOCOMP
2006
14 years 8 days ago
The Use of Context-Sensitive Grammar For Modeling RNA Pseudoknots
- In this study, a context-sensitive grammar is suggested to model various forms of RNA secondary structures, especially pseudoknots. Comparing with a conventional context-free gra...
Keum-Young Sung
BMCBI
2005
95views more  BMCBI 2005»
13 years 10 months ago
Commensurate distances and similar motifs in genetic congruence and protein interaction networks in yeast
Background: In a genetic interaction, the phenotype of a double mutant differs from the combined phenotypes of the underlying single mutants. When the single mutants have no growt...
Ping Ye, Brian D. Peyser, Forrest A. Spencer, Joel...
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
14 years 7 days ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
WIOPT
2006
IEEE
14 years 4 months ago
On the macroscopic effects of local interactions in multi-hop wireless networks
Abstract— The objective of the paper is to provide qualitative insight into the global effects of distributed mechanisms, such as carrier sense multiple access (CSMA) and rate co...
Venkatesh Saligrama, David Starobinski
ICANN
2009
Springer
14 years 3 months ago
An EM Based Training Algorithm for Recurrent Neural Networks
Recurrent neural networks serve as black-box models for nonlinear dynamical systems identification and time series prediction. Training of recurrent networks typically minimizes t...
Jan Unkelbach, Yi Sun, Jürgen Schmidhuber