Sciweavers

1756 search results - page 182 / 352
» Directed scale-free graphs
Sort
View
139
Voted
POS
1994
Springer
15 years 7 months ago
Hardware Support for Stability in a Persistent Architecture
Persistent stores support uniform management of data objects regardless of their lifetimes and locations. Such stores typically maintain a self-consistent state even after failure...
Frans A. Henskens, D. M. Koch, Rasool Jalili, John...
128
Voted
SIGCOMM
1992
ACM
15 years 7 months ago
Internet Routing Over Large Public Data Networks Using Shortcuts
With the emergence of large switched public data networks that are well-suited to connectionless internets, for instance SMDS, it is possible that larger and larger numbers of int...
Paul F. Tsuchiya
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
150
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
144
Voted
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