605 search results - page 22 / 121 » Reducing complexity in tree-like computer interconnection ne... |
STOC
1993
ACM
13 years 11 months ago
1993
ACM
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
COMPUTER
2002
13 years 7 months ago
2002
of abstraction and coarse granularity and distributed communication control. Focusing on using probabilistic metrics such as average values or variance to quantify design objective...
JSAC
2008
13 years 7 months ago
2008
Abstract--Optimal tone allocation in downlink OFDMA networks is a non-convex NP-hard problem that requires extensive feedback for channel information. In this paper, two constantco...
IHI
2012
12 years 3 months ago
2012
Despite recent progress in high-throughput experimental studies, systems level visualization and analysis of large protein interaction networks (ppi) remains a challenging task, g...
CONEXT
2008
ACM
13 years 9 months ago
2008
ACM
Today's Internet's routing paths are inefficient with respect to both connectivity and the market for interconnection. The former manifests itself via needlessly long pa...