Sciweavers

98 search results - page 13 / 20
» IPL at ImageCLEF 2010
Sort
View
IPL
2010
247views more  IPL 2010»
13 years 6 months ago
The Floyd-Warshall algorithm on graphs with negative cycles
The Floyd-Warshall algorithm is a simple and widely used algorithm to compute shortest paths between all pairs of vertices in an edge weighted directed graph. It can also be used ...
Stefan Hougardy
IPL
2010
69views more  IPL 2010»
13 years 6 months ago
A simple representation of subwords of the Fibonacci word
We introduce a representation of subwords of the infinite Fibonacci word f∞ by a specific concatenation of finite Fibonacci words. It is unique and easily computable by backwa...
Bartosz Walczak
IPL
2010
111views more  IPL 2010»
13 years 6 months ago
Connecting face hitting sets in planar graphs
We show that any face hitting set of size n of a connected planar graph with a minimum degree of at least 3 is contained in a connected subgraph of size 5n − 6. Furthermore we s...
Pascal Schweitzer, Patrick Schweitzer
IPL
2010
80views more  IPL 2010»
13 years 6 months ago
The reachability problem for branching vector addition systems requires doubly-exponential space
Branching vector addition systems are an extension of vector addition systems where new reachable vectors may be obtained by summing two reachable vectors and adding an integral v...
Ranko Lazic
IPL
2010
95views more  IPL 2010»
13 years 6 months ago
Resource bisimilarity and graded bisimilarity coincide
Resource bisimilarity has been proposed in the literature on concurrency theory as a notion of bisimilarity over labeled transition systems that takes into account the number of c...
Luca Aceto, Anna Ingólfsdóttir, Josh...