Sciweavers

868 search results - page 24 / 174
» Dynamic Connectivity: Connecting to Networks and Geometry
Sort
View
ICONIP
2004
13 years 9 months ago
A Neural Network Model for Trace Conditioning
We studied the dynamics of a neural network which have both of recurrent excitatory and random inhibitory connections. Neurons started to become active when a relatively weak trans...
Tadashi Yamazaki, Shigeru Tanaka
INFOCOM
2008
IEEE
14 years 1 months ago
Proxy Caching in Split TCP: Dynamics, Stability and Tail Asymptotics
Abstract—The split of a multihop, point to point TCP connection consists in replacing a plain, end-to-end TCP connection by a cascade of TCP connections. In such a cascade, conne...
François Baccelli, Giovanna Carofiglio, Ser...
ICNP
1999
IEEE
13 years 12 months ago
TCP Trunking: Design, Implementation and Performance
A TCP trunk is an aggregate traffic stream whose data packets are transported at a rate dynamically determined by TCP
H. T. Kung, Shie Yuan Wang
ICMCS
1999
IEEE
89views Multimedia» more  ICMCS 1999»
13 years 12 months ago
A Lightweight Protocol for Interconnecting Heterogeneous Devices in Dynamic Environments
In the near future people will be able to move freely and still have seamless network and Internet connectivity. One implication of this new style of interaction is an increased d...
Kevin C. Almeroth, Katia Obraczka, Dante DeLucia
ISAAC
2005
Springer
123views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Sampling Unlabeled Biconnected Planar Graphs
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang