Sciweavers

8825 search results - page 130 / 1765
» All for one or one for all
Sort
View
DCC
2010
IEEE
15 years 1 months ago
A tight asymptotic bound on the size of constant-weight conflict-avoiding codes
In the study of multiple-access in the collision channel, conflict-avoiding code is used to guarantee that each transmitting user can send at least one packet successfully in the w...
Kenneth W. Shum, Wing Shing Wong
DM
2008
86views more  DM 2008»
15 years 1 months ago
Hamiltonian properties of triangular grid graphs
A triangular grid graph is a finite induced subgraph of the infinite graph associated with the two-dimensional triangular grid. In 2000, Reay and Zamfirescu showed that all 2-conne...
Valery S. Gordon, Yury L. Orlovich, Frank Werner
IJON
2006
112views more  IJON 2006»
15 years 1 months ago
Comparison of automated parameter estimation methods for neuronal signaling networks
This work is a suitability study of the different optimization methods for automated parameter estimation (fitting) in the context of neuronal signaling networks. The Gepasi simul...
Antti Pettinen, Olli Yli-Harja, Marja-Leena Linne
IJON
2006
89views more  IJON 2006»
15 years 1 months ago
Flexible kernels for RBF networks
In this paper we propose a novel approach for modeling kernels in Radial Basis Function networks. The method provides an extra degree of flexibility to the kernel structure. This ...
André O. Falcão, Thibault Langlois, ...
JCO
2008
117views more  JCO 2008»
15 years 1 months ago
Approximation algorithms for connected facility location problems
We study Connected Facility Location problems. We are given a connected graph G = (V, E) with nonnegative edge cost ce for each edge e E, a set of clients D V such that each cli...
Mohammad Khairul Hasan, Hyunwoo Jung, Kyung-Yong C...