Sciweavers

557 search results - page 9 / 112
» Visualizing Weighted Edges in Graphs
Sort
View
APVIS
2008
15 years 12 days ago
Energy-Based Hierarchical Edge Clustering of Graphs
Effectively visualizing complex node-link graphs which depict relationships among data nodes is a challenging task due to the clutter and occlusion resulting from an excessive amo...
Hong Zhou, Xiaoru Yuan, Weiwei Cui, Huamin Qu, Bao...
ICALP
1995
Springer
15 years 2 months ago
Shortest Path Queries in Digraphs of Small Treewidth
We consider the problem of preprocessing an n-vertex digraph with real edge weights so that subsequent queries for the shortest path or distance between any two vertices can be efï...
Shiva Chaudhuri, Christos D. Zaroliagis
ALENEX
2010
161views Algorithms» more  ALENEX 2010»
15 years 12 days ago
Route Planning with Flexible Objective Functions
We present the first fast route planning algorithm that answers shortest paths queries for a customizable linear combination of two different metrics, e. g. travel time and energy...
Robert Geisberger, Moritz Kobitzsch, Peter Sanders
SDM
2009
SIAM
331views Data Mining» more  SDM 2009»
15 years 8 months ago
Privacy Preservation in Social Networks with Sensitive Edge Weights.
With the development of emerging social networks, such as Facebook and MySpace, security and privacy threats arising from social network analysis bring a risk of disclosure of con...
Jie Wang, Jinze Liu, Jun Zhang, Lian Liu
ICPR
2010
IEEE
15 years 2 months ago
Fast Super-Resolution Using Weighted Median Filtering
A non-iterative method of image super-resolution based on weighted median filtering with Gaussian weights is proposed. Visual tests and basic edges metrics were used to examine th...
Andrey Nasonov, Andrey S. Krylov