Sciweavers

1172 search results - page 126 / 235
» Path Algorithms on Regular Graphs
Sort
View
PODS
2010
ACM
170views Database» more  PODS 2010»
15 years 7 months ago
A learning algorithm for top-down XML transformations
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
Aurélien Lemay, Sebastian Maneth, Joachim N...
106
Voted
IPPS
1998
IEEE
15 years 6 months ago
A Performance Evaluation of CP List Scheduling Heuristics for Communication Intensive Task Graphs
List-based priority schedulers have long been one of the dominant classes of static scheduling algorithms. Such heuristics have been predominantly based around the "critical ...
Benjamin S. Macey, Albert Y. Zomaya
113
Voted
ISMB
1997
15 years 3 months ago
Automated Alignment of RNA Sequences to Pseudoknotted Structures
Seq7 is a newprogramfor generating multiple structure-based alignments of RNAsequences. Byusing a variant of Dijkstra’s algorithm to find the shortest path through a specially c...
Jack E. Tabaska, Gary D. Stormo
ICALP
1997
Springer
15 years 6 months ago
Model Checking the Full Modal Mu-Calculus for Infinite Sequential Processes
In this paper we develop a new elementary algorithm for model-checking infinite sequential processes, including context-free processes, pushdown processes, and regular graphs, tha...
Olaf Burkart, Bernhard Steffen
154
Voted
IEEEMSP
2002
IEEE
15 years 7 months ago
An optimal shape encoding scheme using skeleton decomposition
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
Haohong Wang, Guido M. Schuster, Aggelos K. Katsag...