Sciweavers

2463 search results - page 287 / 493
» Rankings of Directed Graphs
Sort
View
126
Voted
VLDB
1990
ACM
116views Database» more  VLDB 1990»
15 years 7 months ago
Factoring Augmented Regular Chain Programs
In previous papers we have proposed a graphical query language for expressing traversal recursions in labelled, directed graphs. A fundamental feature of the language is the use o...
Peter T. Wood
149
Voted
CIE
2009
Springer
15 years 7 months ago
Functions Definable by Arithmetic Circuits
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...
Ian Pratt-Hartmann, Ivo Düntsch
DEXA
2006
Springer
138views Database» more  DEXA 2006»
15 years 7 months ago
A Vector Space Model for Semantic Similarity Calculation and OWL Ontology Alignment
Ontology alignment (or matching) is the operation that takes two ontologies and produces a set of semantic correspondences (usually semantic similarities) between some elements of ...
Rubén Tous, Jaime Delgado
155
Voted
APAQS
2001
IEEE
15 years 7 months ago
Object-Oriented Program Behavior Analysis Based on Control Patterns
Code-patterns are statically recurring structure specific to a programming language. It can be parallel to aid in designing software systems for solving particular problems. Contr...
C.-C. Hwang, S.-K. Huang, D.-J. Chen, D. Chen
133
Voted
CIAC
2010
Springer
246views Algorithms» more  CIAC 2010»
15 years 7 months ago
Capacitated Confluent Flows: Complexity and Algorithms
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
Daniel Dressler and Martin Strehler