658 search results - page 75 / 132 » Lower bounds for sorting networks |
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—We present the first unified modeling framework for the computation of the throughput capacity of random wireless ad hoc networks in which information is disseminated by means...
EUROCOLT
1997
Springer
13 years 12 months ago
1997
Springer
Most of the work on the Vapnik-Chervonenkis dimension of neural networks has been focused on feedforward networks. However, recurrent networks are also widely used in learning app...
STOC
2010
ACM
14 years 20 days ago
2010
ACM
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
PLDI
2004
ACM
14 years 1 months ago
2004
ACM
+ Modern network processors employ multi-threading to allow concurrency amongst multiple packet processing tasks. We studied the properties of applications running on the network p...
WAOA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We consider a Stackelberg pricing problem in directed networks. Tariffs have to be defined by an operator, the leader, for a subset of the arcs, the tariff arcs. Clien...