Sciweavers

866 search results - page 38 / 174
» Algorithms for Comparing Pedigree Graphs
Sort
View
APVIS
2009
13 years 10 months ago
A hybrid space-filling and force-directed layout method for visualizing multiple-category graphs
Many graphs used in real-world applications consist of nodes belonging to more than one category. We call such graph "multiplecategory graphs". Social networks are typic...
Takayuki Itoh, Chris Muelder, Kwan-Liu Ma, Jun Ses...
ICDM
2009
IEEE
153views Data Mining» more  ICDM 2009»
13 years 6 months ago
A New Clustering Algorithm Based on Regions of Influence with Self-Detection of the Best Number of Clusters
Clustering methods usually require to know the best number of clusters, or another parameter, e.g. a threshold, which is not ever easy to provide. This paper proposes a new graph-b...
Fabrice Muhlenbach, Stéphane Lallich
ACL
2010
13 years 7 months ago
Experiments in Graph-Based Semi-Supervised Learning Methods for Class-Instance Acquisition
Graph-based semi-supervised learning (SSL) algorithms have been successfully used to extract class-instance pairs from large unstructured and structured text collections. However,...
Partha Pratim Talukdar, Fernando Pereira
SOFSEM
2007
Springer
14 years 3 months ago
Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
Miroslaw Dynia, Miroslaw Korzeniowski, Jaroslaw Ku...
ISPD
2010
ACM
207views Hardware» more  ISPD 2010»
14 years 4 months ago
FOARS: FLUTE based obstacle-avoiding rectilinear steiner tree construction
Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is becoming one of the most sought after problems in modern design flow. In this paper we present FOARS, ...
Gaurav Ajwani, Chris Chu, Wai-Kei Mak