Sciweavers

2487 search results - page 46 / 498
» Partitions of Graphs into Trees
Sort
View
CCCG
2010
13 years 10 months ago
Approximating the independent domatic partition problem in random geometric graphs - an experimental study
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...
ICPR
2008
IEEE
14 years 10 months ago
Multiclass spectral clustering based on discriminant analysis
Many existing spectral clustering algorithms share a conventional graph partitioning criterion: normalized cuts (NC). However, one problem with NC is that it poorly captures the g...
Xi Li, Zhongfei Zhang, Yanguo Wang, Weiming Hu
WWW
2008
ACM
14 years 10 months ago
Efficiently querying rdf data in triple stores
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
PAAPP
2006
85views more  PAAPP 2006»
13 years 9 months ago
A new metric splitting criterion for decision trees
Abstract: We examine a new approach to building decision tree by introducing a geometric splitting criterion, based on the properties of a family of metrics on the space of partiti...
Dan A. Simovici, Szymon Jaroszewicz
LION
2009
Springer
152views Optimization» more  LION 2009»
14 years 3 months ago
Comparison of Coarsening Schemes for Multilevel Graph Partitioning
Graph partitioning is a well-known optimization problem of great interest in theoretical and applied studies. Since the 1990s, many multilevel schemes have been introduced as a pra...
Cédric Chevalier, Ilya Safro