1002 search results - page 96 / 201 » Towards Graph Programs for Graph Algorithms |
103
click to vote
ESOP
1990
Springer
15 years 6 months ago
1990
Springer
The need to integrate several versions of a program into a common one arises frequently, but it is a tedious and time consuming task to merge programs by hand. The program-integrat...
130
Voted
VLDB
2004
ACM
15 years 8 months ago
2004
ACM
Link analysis methods show that the interconnections between web pages have lots of valuable information. The link analysis methods are, however, inherently oriented towards analy...
94
Voted
ICALP
2010
Springer
15 years 7 months ago
2010
Springer
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability...
115
Voted
ALGORITHMICA
2010
15 years 2 months ago
2010
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
106
click to vote
ICALP
1995
Springer
15 years 6 months ago
1995
Springer
We consider the problem of preprocessing an n-vertex digraph with real edge weights so that subsequent queries for the shortest path or distance between any two vertices can be ef...