37 search results - page 6 / 8 » On the searchability of small-world networks with arbitrary ... |
COMGEO
2010
ACM
13 years 6 months ago
2010
ACM
We study the complexity and the I/O-efficient computation of flow on triangulated terrains. We present an acyclic graph, the descent graph, that enables us to trace flow paths in ...
EDBT
2000
ACM
13 years 10 months ago
2000
ACM
the research activities. This abstract is to introduce the approach of a data model - EP data model. Its data structure is able to store as a finite set of nodes arbitrary effectiv...
IWDC
2001
Springer
13 years 10 months ago
2001
Springer
— In this paper we show that significant simplicity can be exploited for pricing-based control of large networks. We first consider a general loss network with Poisson arrivals...
SIGCOMM
1996
ACM
13 years 10 months ago
1996
ACM
There is much experimental evidence that network traffic processes exhibit ubiquitous properties of self-similarity and long-range dependence, i.e., of correlations over a wide ran...
BMCBI
2007
13 years 6 months ago
2007
Background: Structure identification of dynamic models for complex biological systems is the cornerstone of their reverse engineering. Biochemical Systems Theory (BST) offers a pa...