Sciweavers

113 search results - page 12 / 23
» Obnoxious Centers in Graphs
Sort
View
APVIS
2009
13 years 7 months ago
Extending the spring-electrical model to overcome warping effects
The spring-electrical model based force directed algorithm is widely used for drawing undirected graphs, and sophisticated implementations can be very efficient for visualizing la...
Yifan Hu, Yehuda Koren
ICWSM
2009
13 years 4 months ago
Gephi: An Open Source Software for Exploring and Manipulating Networks
Gephi is an open source software for graph and network analysis. It uses a 3D render engine to display large networks in real-time and to speed up the exploration. A flexible and ...
Mathieu Bastian, Sebastien Heymann, Mathieu Jacomy
ICPR
2004
IEEE
14 years 7 months ago
Landscape of Clustering Algorithms
Numerous clustering algorithms, their taxonomies and evaluation studies are available in the literature. Despite the diversity of different clustering algorithms, solutions delive...
Anil K. Jain, Alexander P. Topchy, Martin H. C. La...
ICSE
2008
IEEE-ACM
14 years 7 months ago
Debugging reinvented: asking and answering why and why not questions about program behavior
When software developers want to understand the reason for a program's behavior, they must translate their questions about the behavior into a series of questions about code,...
Andrew Jensen Ko, Brad A. Myers
CVPR
2010
IEEE
14 years 3 months ago
3D Shape Correspondence by Isometry-Driven Greedy Optimization
We present an automatic method that establishes 3D correspondence between isometric shapes. Our goal is to find an optimal correspondence between two given (nearly) isometric sha...
Yusuf Sahillioglu, Yucel Yemez