505 search results - page 90 / 101 » On A Graph Formalism for Ordered Edges |
CAV
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Separation Logic consists of a Boolean combination of predicates of the form vi ≥ vj +c where c is a constant and vi, vj are variables of some ordered infinite type li...
BMCBI
2008
14 years 9 months ago
2008
Background: Visualising the evolutionary history of a set of sequences is a challenge for molecular phylogenetics. One approach is to use undirected graphs, such as median network...
102
click to vote
TAMC
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
155
click to vote
LCC
1994
15 years 1 months ago
1994
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
CORR
2010
Springer
14 years 4 months ago
2010
Springer
Malicious mobile phone worms spread between devices via short-range Bluetooth contacts, similar to the propagation of human and other biological viruses. Recent work has employed m...