Sciweavers

1511 search results - page 64 / 303
» Randomness, lowness and degrees
Sort
View
SAINT
2007
IEEE
16 years 12 days ago
On the Effect of Scale-Free Structure of Network Topology on End-to-End Performance
In recent years, it has been reported that several existing networks including the Internet have scale-free structure. In this paper, through a simple numerical analysis, we inves...
Hiroyuki Ohsaki, Koutaro Yagi, Makoto Imase
IM
2008
15 years 6 months ago
The Structure of Geographical Threshold Graphs
We analyze the structure of random graphs generated by the geographical threshold model. The model is a generalization of random geometric graphs. Nodes are distributed in space, a...
Milan Bradonjic, Aric A. Hagberg, Allon G. Percus
MFCS
2007
Springer
16 years 8 days ago
Communication in Networks with Random Dependent Faults
The aim of this paper is to study communication in networks where nodes fail in a random dependent way. In order to capture fault dependencies, we introduce the neighborhood fault...
Evangelos Kranakis, Michel Paquette, Andrzej Pelc
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
15 years 8 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
DAC
2000
ACM
16 years 7 months ago
Code compression for low power embedded system design
erse approaches at all levels of abstraction starting from the physical level up to the system level. Experience shows that a highlevel method may have a larger impact since the de...
Haris Lekatsas, Jörg Henkel, Wayne Wolf