Sciweavers

2079 search results - page 311 / 416
» Universality of random graphs
Sort
View
ESA
2003
Springer
118views Algorithms» more  ESA 2003»
15 years 9 months ago
The Voronoi Diagram of Planar Convex Objects
This paper presents a dynamic algorithm for the construction of the Euclidean Voronoi diagram of a set of convex objects in the plane. We consider first the Voronoi diagram of smo...
Menelaos I. Karavelas, Mariette Yvinec
INFOCOM
2002
IEEE
15 years 9 months ago
Using the Small-World Model to Improve Freenet Performance
– Efficient data retrieval in a peer-to-peer system like Freenet is a challenging problem. In this paper we study the impact of cache replacement policy on the performance of Fre...
Hui Zhang 0002, Ashish Goel, Ramesh Govindan
FPGA
1997
ACM
145views FPGA» more  FPGA 1997»
15 years 8 months ago
Generation of Synthetic Sequential Benchmark Circuits
Programmable logic architectures increase in capacity before commercial circuits are designed for them, yielding a distinct problem for FPGA vendors: how to test and evaluate the ...
Michael D. Hutton, Jonathan Rose, Derek G. Corneil
MABS
2000
Springer
15 years 8 months ago
Effects of Interaction Topology and Activation Regime in Several Multi-Agent Systems
The effects of distinct agent interaction and activation structures are compared and contrasted in several multi-agent models of social phenomena. Random graphs and lattices repre...
Robert L. Axtell
TREC
2008
15 years 5 months ago
Weighted PageRank: Cluster-Related Weights
PageRank is a way to rank Web pages taking into account hyper-link structure of the Web. PageRank provides efficient and simple method to find out ranking of Web pages exploiting ...
Danil Nemirovsky, Konstantin Avrachenkov