Sciweavers

2463 search results - page 363 / 493
» Rankings of Directed Graphs
Sort
View
CPM
2001
Springer
108views Combinatorics» more  CPM 2001»
14 years 1 months ago
A Very Elementary Presentation of the Hannenhalli-Pevzner Theory
In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation.Their solution, a...
Anne Bergeron
FSTTCS
2001
Springer
14 years 1 months ago
Distributed LTL Model Checking Based on Negative Cycle Detection
Abstract. This paper addresses the state explosion problem in automata based LTL model checking. To deal with large space requirements we turn to use a distributed approach. All th...
Lubos Brim, Ivana Cerná, Pavel Krcál...
ESA
1998
Springer
169views Algorithms» more  ESA 1998»
14 years 1 months ago
Augmenting Suffix Trees, with Applications
Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one ...
Yossi Matias, S. Muthukrishnan, Süleyman Cenk...
KES
1998
Springer
14 years 1 months ago
Intensity reasoning by constraint propagation based on causal relationships
Many events in the world occur with some quantity that shows a level of the occurrence. This paper discusses reasoning with the normalized level of the occurrence, which we call i...
Koichi Yamada
INFOCOM
1993
IEEE
14 years 1 months ago
Power-Optimal Layout of Passive, Single-Hop, Fiber-Optic Interconnections Whose Capacity Increases with the Number of Stations
Passive, single-hop interconnections among N stations, each with several transmitters and receivers, provide a communication path between any two stations using one of the transmi...
Yitzhak Birk