Sciweavers

177 search results - page 16 / 36
» Multi-way Clustering on Relation Graphs
Sort
View
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
15 years 2 months ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...
LWA
2007
14 years 11 months ago
Multi-objective Frequent Termset Clustering
Large, high dimensional data spaces, are still a challenge for current data clustering methods. Frequent Termset (FTS) clustering is a technique developed to cope with these chall...
Andreas Kaspari, Michael Wurst
ICPR
2008
IEEE
15 years 3 months ago
Object recognition using graph spectral invariants
Graph structures have been proved important in high level-vision since they can be used to represent structural and relational arrangements of objects in a scene. One of the probl...
Bai Xiao, Richard C. Wilson, Edwin R. Hancock
CORR
2008
Springer
87views Education» more  CORR 2008»
14 years 9 months ago
Visualization of association graphs for assisting the interpretation of classifications
Given a query on the PASCAL database maintained by the INIST, we design user interfaces to visualize and wo types of graphs extracted from abstracts: 1) the graph of all associati...
Eric SanJuan, Ivana Roche
IM
2008
14 years 9 months ago
The Structure of Geographical Threshold Graphs
We analyze the structure of random graphs generated by the geographical threshold model. The model is a generalization of random geometric graphs. Nodes are distributed in space, a...
Milan Bradonjic, Aric A. Hagberg, Allon G. Percus