Sciweavers

478 search results - page 37 / 96
» Structural Properties of Twin-Free Graphs
Sort
View
COLING
2000
13 years 10 months ago
Context-Free Grammar Rewriting and the Transfer of Packed Linguistic Representations
We propose an algorithm for the trausfer of packed linguistic structures, that is, finite collections of labelled graphs which share certain subparts. A labelled graph is seen as ...
Marc Dymetman, Frédéric Tendeau
NETWORKING
2011
12 years 11 months ago
STEPS - An Approach for Human Mobility Modeling
Abstract. In this paper we introduce Spatio-TEmporal Parametric Stepping (STEPS) - a simple parametric mobility model which can cover a ectrum of human mobility patterns. STEPS mak...
Anh Dung Nguyen, Patrick Sénac, Victor Rami...
KAIS
2011
129views more  KAIS 2011»
13 years 3 months ago
Counting triangles in real-world networks using projections
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
Charalampos E. Tsourakakis
SEMWEB
2009
Springer
14 years 3 months ago
Node-Link and Containment Methods in Ontology Visualization
OWL Ontology language can be very expressive. This could provide difficulty in ontology understanding process. We belief, that an ontology visualization equipped with intuitive int...
Julia Dmitrieva, Fons J. Verbeek
FSTTCS
2010
Springer
13 years 6 months ago
First-Order Logic with Reachability Predicates on Infinite Systems
This paper focuses on first-order logic (FO) extended by reachability predicates such that the expressiveness and hence decidability properties lie between FO and monadic second-o...
Stefan Schulz