Sciweavers

969 search results - page 24 / 194
» A New Metric Between Polygons and How to Compute it
Sort
View
AINA
2010
IEEE
13 years 6 months ago
TCP Testing: How Well Does ns2 Match Reality?
New transport protocols continue to appear as alternatives to the Transmission Control Protocol (TCP). Many of these are are designed to address TCP's inefficiency in operatin...
Martin Bateman, Saleem N. Bhatti
ISPDC
2006
IEEE
14 years 2 months ago
How to Achieve High Throughput with Dynamic Tree-Structured Coterie
Data replication permits a better network bandwidth utilization and minimizes the effect of latency in large-scale systems such as computing grids. However, the cost of maintainin...
Ivan Frain, Abdelaziz Mzoughi, Jean Paul Bahsoun
ICCCN
2008
IEEE
14 years 3 months ago
Localized Bridging Centrality for Distributed Network Analysis
— Centrality is a concept often used in social network analysis to study different properties of networks that are modeled as graphs. We present a new centrality metric called Lo...
Soumendra Nanda, David Kotz
WG
2010
Springer
13 years 7 months ago
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse,...
HPCA
2008
IEEE
14 years 9 months ago
Gaining insights into multicore cache partitioning: Bridging the gap between simulation and real systems
Cache partitioning and sharing is critical to the effective utilization of multicore processors. However, almost all existing studies have been evaluated by simulation that often ...
Jiang Lin, Qingda Lu, Xiaoning Ding, Zhao Zhang, X...