Sciweavers

505 search results - page 71 / 101
» On A Graph Formalism for Ordered Edges
Sort
View
ER
2006
Springer
112views Database» more  ER 2006»
15 years 1 months ago
A DAG Comparison Algorithm and Its Application to Temporal Data Warehousing
Abstract. We present a new technique for discovering and representing structural changes between two versions of a directed acyclic graph (DAG). Motivated by the necessity of chang...
Johann Eder, Karl Wiggisser
AUSAI
2008
Springer
14 years 11 months ago
Learning a Generative Model for Structural Representations
Abstract. Graph-based representations have been used with considercess in computer vision in the abstraction and recognition of object shape and scene structure. Despite this, the ...
Andrea Torsello, David L. Dowe
SIAMDM
2010
128views more  SIAMDM 2010»
14 years 8 months ago
Permutation Capacities of Families of Oriented Infinite Paths
K¨orner and Malvenuto asked whether one can find n n/2 linear orderings (i.e., permutations) of the first n natural numbers such that any pair of them places two consecutive int...
Graham Brightwell, Gérard D. Cohen, Emanuel...
CDC
2010
IEEE
172views Control Systems» more  CDC 2010»
14 years 1 months ago
Electrical centrality measures for electric power grid vulnerability analysis
— This paper investigates measures of centrality that are applicable to power grids. Centrality measures are used in network science to rank the relative importance of nodes and ...
Zhifang Wang, Anna Scaglione, Robert J. Thomas
CORR
2006
Springer
119views Education» more  CORR 2006»
14 years 9 months ago
Network Inference from Co-Occurrences
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
Michael Rabbat, Mário A. T. Figueiredo, Rob...