Sciweavers

552 search results - page 26 / 111
» Observable Graphs
Sort
View
IMCSIT
2010
13 years 6 months ago
On the implementation of public keys algorithms based on algebraic graphs over finite commutative rings
We will consider balanced directed graphs, i.e., graphs of binary relations, for which the number of inputs and number of outputs are the same for each vertex. The commutative diag...
Michal Klisowski, Vasyl Ustimenko
RR
2010
Springer
13 years 6 months ago
Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination on RDF graphs in the presence of rules (in the form of Datalog r...
Reinhard Pichler, Axel Polleres, Sebastian Skritek...
ALENEX
2003
137views Algorithms» more  ALENEX 2003»
13 years 9 months ago
The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs
Graph models for real-world complex networks such as the Internet, the WWW and biological networks are necessary for analytic and simulation-based studies of network protocols, al...
Christos Gkantsidis, Milena Mihail, Ellen W. Zegur...
ICSM
2009
IEEE
14 years 2 months ago
Incremental call graph reanalysis for AspectJ software
Program call graph representation can be used to support many tasks in compiler optimization, program comprehension, and software maintenance. During software evolution, the call ...
Yu Lin, Sai Zhang, Jianjun Zhao
CORR
2008
Springer
71views Education» more  CORR 2008»
13 years 8 months ago
Problem Solving and Complex Systems
The observation and modeling of natural Complex Systems (CSs) like the human nervous system, the evolution or the weather, allows the definition of special abilities and models re...
Frédéric Guinand, Yoann Pigné