Sciweavers

4009 search results - page 89 / 802
» Clustering on Complex Graphs
Sort
View
SEMWEB
2005
Springer
15 years 5 months ago
Combining RDF and Part of OWL with Rules: Semantics, Decidability, Complexity
This paper extends the model theory of RDF with rules, placing an emphasis on integration with OWL and decidability of entailstart from an abstract syntax that views a rule as a pa...
Herman J. ter Horst
CORR
2011
Springer
192views Education» more  CORR 2011»
14 years 6 months ago
On cooperative patrolling: optimal trajectories, complexity analysis, and approximation algorithms
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
Fabio Pasqualetti, Antonio Franchi, Francesco Bull...
ICCS
2004
Springer
15 years 5 months ago
Clustering of Conceptual Graphs with Sparse Data
This paper gives a theoretical framework for clustering a set of conceptual graphs characterized by sparse descriptions. The formed clusters are named in an intelligible manner thr...
Jean-Gabriel Ganascia, Julien Velcin
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
14 years 2 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
SOFSEM
2007
Springer
15 years 6 months ago
Straightening Drawings of Clustered Hierarchical Graphs
In this paper we deal with making drawings of clustered hierarchical graphs nicer. Given a planar graph G = (V, E) with an assignment of the vertices to horizontal layers, a plane ...
Sergey Bereg, Markus Völker, Alexander Wolff,...