Sciweavers

596 search results - page 38 / 120
» Complexity Analysis by Graph Rewriting
Sort
View
EDOC
2007
IEEE
14 years 2 months ago
Incorporating Security Behaviour into Business Models Using a Model Driven Approach
There has, in recent years, been growing interest in Model Driven Engineering (MDE), in which models are the primary design artifacts and transformations are applied to these mode...
Peter F. Linington, Pulitha Liyanagama
COMPGEOM
2011
ACM
12 years 11 months ago
Reeb graphs: approximation and persistence
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
Tamal K. Dey, Yusu Wang
KDD
2009
ACM
204views Data Mining» more  KDD 2009»
14 years 8 months ago
DOULION: counting triangles in massive graphs with a coin
Counting the number of triangles in a graph is a beautiful algorithmic problem which has gained importance over the last years due to its significant role in complex network analy...
Charalampos E. Tsourakakis, U. Kang, Gary L. Mille...
SYRCODIS
2008
184views Database» more  SYRCODIS 2008»
13 years 9 months ago
Towards Cost-based Query Optimization in Native XML Database Management Systems
In the last few years, XML became a de-facto standard for the exchange of structured and semi-structured data. The database research community took this development into account b...
Andreas M. Weiner, Christian Mathis, Theo Här...
SAC
2010
ACM
14 years 2 months ago
Estimating node similarity from co-citation in a spatial graph model
Co-citation (number of nodes linking to both of a given pair of nodes) is often used heuristically to judge similarity between nodes in a complex network. We investigate the relat...
Jeannette Janssen, Pawel Pralat, Rory Wilson