Sciweavers

3204 search results - page 160 / 641
» The Alcuin Number of a Graph
Sort
View
ESWS
2007
Springer
14 years 2 months ago
A Performance and Scalability Metric for Virtual RDF Graphs
Abstract. From a theoretical point of view, the Semantic Web is understood in terms of a stack with RDF being one of its layers. A Semantic Web application operates on the common d...
Michael Hausenblas, Wolfgang Slany, Danny Ayers
SOICT
2010
13 years 3 months ago
Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuon...
CORR
2011
Springer
139views Education» more  CORR 2011»
13 years 2 days ago
Clustering Partially Observed Graphs via Convex Optimization
This paper considers the problem of clustering a partially observed unweighted graph – i.e. one where for some node pairs we know there is an edge between them, for some others ...
Ali Jalali, Yudong Chen, Sujay Sanghavi, Huan Xu
COMBINATORICS
2006
121views more  COMBINATORICS 2006»
13 years 8 months ago
Identifying Graph Automorphisms Using Determining Sets
A set of vertices S is a determining set for a graph G if every automorphism of G is uniquely determined by its action on S. The determining number of a graph is the size of a sma...
Debra L. Boutin
ICDM
2008
IEEE
107views Data Mining» more  ICDM 2008»
14 years 2 months ago
Graph-Based Iterative Hybrid Feature Selection
When the number of labeled examples is limited, traditional supervised feature selection techniques often fail due to sample selection bias or unrepresentative sample problem. To ...
ErHeng Zhong, Sihong Xie, Wei Fan, Jiangtao Ren, J...