103 search results - page 8 / 21 » Direct Algorithms for Computing the Transitive Closure of Da... |
CAV
2001
Springer
14 years 12 days ago
2001
Springer
Regular languages have proved useful for the symbolic state exploration of infinite state systems. They can be used to represent infinite sets of system configurations; the tran...
VLDB
2004
ACM
14 years 8 months ago
2004
ACM
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
CONCUR
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
VLDB
2004
ACM
14 years 1 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...
SSD
2001
Springer
14 years 10 days ago
2001
Springer
Like people who casually assess similarity between spatial scenes in their routine activities, users of pictorial databases are often interested in retrieving scenes that are simil...