Sciweavers

845 search results - page 15 / 169
» Diagnosabilities of regular networks
Sort
View
ATVA
2008
Springer
131views Hardware» more  ATVA 2008»
13 years 9 months ago
Computation Tree Regular Logic for Genetic Regulatory Networks
Model checking has proven to be a useful analysis technique not only for concurrent systems, but also for the genetic regulatory networks (Grns) that govern the functioning of livi...
Radu Mateescu, Pedro T. Monteiro, Estelle Dumas, H...
NIPS
2008
13 years 9 months ago
Regularized Learning with Networks of Features
For many supervised learning problems, we possess prior knowledge about which features yield similar information about the target variable. In predicting the topic of a document, ...
Ted Sandler, John Blitzer, Partha Pratim Talukdar,...
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
13 years 9 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau
SPIRE
2010
Springer
13 years 6 months ago
Fast Bit-Parallel Matching for Network and Regular Expressions
Abstract. In this paper, we extend the SHIFT-AND approach by BaezaYates and Gonnet (CACM 35(10), 1992) to the matching problem for network expressions, which are regular expression...
Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura
ESANN
2008
13 years 9 months ago
A Regularized Learning Method for Neural Networks Based on Sensitivity Analysis
The Sensitivity-Based Linear Learning Method (SBLLM) is a learning method for two-layer feedforward neural networks, based on sensitivity analysis, that calculates the weights by s...
Bertha Guijarro-Berdiñas, Oscar Fontenla-Ro...