Sciweavers

335 search results - page 23 / 67
» High quality graph partitioning
Sort
View
DAGSTUHL
2000
14 years 8 days ago
Presenting Data from Experiments in Algorithmics
Algorithmic experiments yield large amounts of data that depends on many parameters. This paper collects a number of rules for presenting this data in concise, meaningful, understa...
Peter Sanders
CN
2006
106views more  CN 2006»
13 years 11 months ago
Efficient large-scale BGP simulations
Simulation has been the method of choice for analyzing large, complex, and highly volatile systems. One of these systems is the inter-domain routing infrastructure of the Internet...
Xenofontas A. Dimitropoulos, George F. Riley
ICDM
2005
IEEE
190views Data Mining» more  ICDM 2005»
14 years 4 months ago
Neighborhood Formation and Anomaly Detection in Bipartite Graphs
Many real applications can be modeled using bipartite graphs, such as users vs. files in a P2P system, traders vs. stocks in a financial trading system, conferences vs. authors ...
Jimeng Sun, Huiming Qu, Deepayan Chakrabarti, Chri...
ICDCS
2010
IEEE
14 years 28 days ago
Distributed Coverage in Wireless Ad Hoc and Sensor Networks by Topological Graph Approaches
Abstract—Coverage problem is a fundamental issue in wireless ad hoc and sensor networks. Previous techniques for coverage scheduling often require accurate location information o...
Dezun Dong, Yunhao Liu, Kebin Liu, Xiangke Liao
PROCEDIA
2010
344views more  PROCEDIA 2010»
13 years 9 months ago
Towards high-quality, untangled meshes via a force-directed graph embedding approach
High quality meshes are crucial for the solution of partial differential equations (PDEs) via the finite element method (or other PDE solvers). The accuracy of the PDE solution,...
Sanjukta Bhowmick, Suzanne M. Shontz