736 search results - page 6 / 148 » Approximating the Number of Network Motifs |
AAIM
2005
Springer
13 years 9 months ago
2005
Springer
In this paper, we study how to, given a set of pre-routed requests in an all-optical network and a set of wavelengths available on each link, assign a subset of requests with maxim...
IMC
2003
ACM
14 years 20 days ago
2003
ACM
Internet topology information is only made available in aggregate form by standard routing protocols. Connectivity information and latency characteristicsmust therefore be inferre...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We present an achievable rate for general Gaussian relay networks. We show that the achievable rate is within a constant number of bits from the information-theoretic cut-set uppe...
RECOMB
2003
Springer
14 years 7 months ago
2003
Springer
The availability of whole genome sequences and high-throughput genomic assays opens the door for in silico analysis of transcription regulation. This includes methods for discover...
ADCM
2000
13 years 7 months ago
2000
This paper is devoted to the analysis of network approximation in the framework of approximation and regularization theory. It is shown that training neural networks and similar n...