Sciweavers

736 search results - page 21 / 148
» Approximating the Number of Network Motifs
Sort
View
ESANN
2003
14 years 11 months ago
Fast approximation of the bootstrap for model selection
The bootstrap resampling method may be efficiently used to estimate the generalization error of a family of nonlinear regression models, as artificial neural networks. The main dif...
Geoffroy Simon, Amaury Lendasse, Vincent Wertz, Mi...
WSC
2001
14 years 11 months ago
Deterministic fluid models of congestion control in high-speed networks
Congestion control algorithms, such as TCP or the closelyrelated additive increase-multiplicative decrease algorithms, are extremely difficult to simulate on a large scale. The re...
Sanjay Shakkottai, R. Srikant
MST
2010
187views more  MST 2010»
14 years 4 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda
IMC
2006
ACM
15 years 3 months ago
Approximate fingerprinting to accelerate pattern matching
Pattern matching and analysis over network data streams is increasingly becoming an essential primitive of network monitoring systems. It is a fundamental part of most intrusion d...
Ramaswamy Ramaswamy, Lukas Kencl, Gianluca Iannacc...
ICNP
2007
IEEE
15 years 4 months ago
FRASA: Feedback Retransmission Approximation for the Stability Region of Finite-User Slotted ALOHA
—FRASA, Feedback Retransmission Approximation for Slotted ALOHA, is proposed to study the stability region of finiteuser slotted ALOHA under collision channel. With FRASA, the s...
Ka-Hung Hui, On-Ching Yue, Wing Cheong Lau