Sciweavers

439 search results - page 57 / 88
» Engineering Comparators for Graph Clusterings
Sort
View
IGIS
1994
156views GIS» more  IGIS 1994»
13 years 12 months ago
Optimizing Spatial Data Structures For Static Data
During the last decade various spatial data structures have been designed and compared against each other, all of them re ecting a dynamic situation with ongoing object insertion a...
Lukas Bachmann, Bernd-Uwe Pagel, Hans-Werner Six
INFOCOM
2002
IEEE
14 years 24 days 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
ICSM
2006
IEEE
14 years 1 months ago
Software Feature Understanding in an Industrial Setting
Software Engineers frequently need to locate and understand the code that implements a specific user feature of a large system. This paper reports on a study by Motorola Inc. and ...
Michael Jiang, Michael Groble, Sharon Simmons, Den...
ANTSW
2004
Springer
13 years 11 months ago
Mesh-Partitioning with the Multiple Ant-Colony Algorithm
ed Abstract We present two heuristic mesh-partitioning methods, both of which build on the multiple ant-colony algorithm in order to improve the quality of the mesh partitions. The...
Peter Korosec, Jurij Silc, Borut Robic
TIT
2010
82views Education» more  TIT 2010»
13 years 2 months ago
Average message delivery time for small-world networks in the continuum limit
Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared wit...
Hazer Inaltekin, Mung Chiang, H. Vincent Poor