Sciweavers

557 search results - page 16 / 112
» Visualizing Weighted Edges in Graphs
Sort
View
AAAI
2007
15 years 1 months ago
Graph Partitioning Based on Link Distributions
Existing graph partitioning approaches are mainly based on optimizing edge cuts and do not take the distribution of edge weights (link distribution) into consideration. In this pa...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
ICALP
2009
Springer
15 years 11 months ago
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip ...
CVPR
2012
IEEE
13 years 1 months ago
A Unified Framework for Event Summarization and Rare Event Detection
A novel approach for event summarization and rare event detection is proposed. Unlike conventional methods that deal with event summarization and rare event detection independently...
Junseok Kwon and Kyoung Mu Lee
71
Voted
INCDM
2007
Springer
121views Data Mining» more  INCDM 2007»
15 years 5 months ago
Collaborative Filtering Using Electrical Resistance Network Models
Abstract. In a recommender system where users rate items we predict the rating of items users have not rated. We define a rating graph containing users and items as vertices and r...
Jérôme Kunegis, Stephan Schmidt
ISM
2006
IEEE
122views Multimedia» more  ISM 2006»
15 years 5 months ago
SuperGraph Visualization
Given a large social or computer network, how can we visualize it, find patterns, outliers, communities? Although several graph visualization tools exist, they cannot handle larg...
José Fernando Rodrigues Jr., Agma J. M. Tra...