Sciweavers

3122 search results - page 96 / 625
» A Theory of Network Equivalence
Sort
View
NN
2008
Springer
15 years 6 months ago
Two k-winners-take-all networks with discontinuous activation functions
This paper presents two k-winners-take-all (k-WTA) networks with discontinuous activation functions. The k-WTA operation is first converted equivalently into linear and quadratic ...
Qingshan Liu, Jun Wang
SIGCOMM
2004
ACM
15 years 11 months ago
Sizing router buffers
All Internet routers contain buffers to hold packets during times of congestion. Today, the size of the buffers is determined by the dynamics of TCP’s congestion control algor...
Guido Appenzeller, Isaac Keslassy, Nick McKeown
COCO
2000
Springer
112views Algorithms» more  COCO 2000»
15 years 10 months ago
Combinatorial Interpretation of Kolmogorov Complexity
Kolmogorov’s very first paper on algorithmic information theory (Kolmogorov, Problemy peredachi infotmatsii 1(1) (1965), 3) was entitled “Three approaches to the definition ...
Andrei E. Romashchenko, Alexander Shen, Nikolai K....
DGO
2006
112views Education» more  DGO 2006»
15 years 7 months ago
Matching and integration across heterogeneous data sources
A sea of undifferentiated information is forming from the body of data that is collected by people and organizations, across government, for different purposes, at different times...
Patrick Pantel, Andrew Philpot, Eduard H. Hovy
MSCS
2010
84views more  MSCS 2010»
15 years 4 months ago
Channel abstractions for network security
Abstractions for Network Security† MICH E L E B U G L I E S I, R I C C A R D O F O C A R D I Dipartimento di Informatica, Universit`a Ca’ Foscari, Venice. Received 6 October 20...
Michele Bugliesi, Riccardo Focardi