Sciweavers

359 search results - page 22 / 72
» Multi-state Directed Acyclic Graphs
Sort
View
ICNP
2000
IEEE
15 years 4 months ago
Convergent Multi-Path Routing
We present a protocol for maintaining multiple paths to each destination in a network of processes. For each destination, each process in the network maintains a set of neighbors ...
Jorge Arturo Cobb
87
Voted
ER
2006
Springer
112views Database» more  ER 2006»
15 years 3 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
APPINF
2003
15 years 1 months ago
Fast Recursive Data Processing in Graphs using Reduction
This paper presents an algorithm for recursive data processing in directed graphs. The proposed algorithm applies graph reduction in order to determine both starting points and a ...
J. H. ter Bekke, J. A. Bakker
JALC
2002
97views more  JALC 2002»
14 years 11 months ago
Semiring Frameworks and Algorithms for Shortest-Distance Problems
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
Mehryar Mohri
ICML
2009
IEEE
16 years 12 days ago
Bandit-based optimization on graphs with application to library performance tuning
The problem of choosing fast implementations for a class of recursive algorithms such as the fast Fourier transforms can be formulated as an optimization problem over the language...
Arpad Rimmel, Frédéric de Mesmay, Ma...