Sciweavers

220 search results - page 27 / 44
» tcs 2008
Sort
View
TCS
2008
13 years 9 months ago
True-concurrency probabilistic models: Markov nets and a law of large numbers
We introduce the model of Markov nets, a probabilistic extension of safe Petri nets under the true-concurrency semantics--this means that traces, not firing sequences, are given a...
Samy Abbes, Albert Benveniste
TCS
2008
13 years 9 months ago
The cost of offline binary search tree algorithms and the complexity of the request sequence
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
Jussi Kujala, Tapio Elomaa
TCS
2008
13 years 9 months ago
Sequential vs. parallel complexity in simple gene assembly
We investigate some differences between the general intramolecular model for gene assembly and its restricted simple model. Although both models satisfactorily sort all current ex...
Miika Langille, Ion Petre
TCS
2008
13 years 9 months ago
Succinct representations of planar maps
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...
Luca Castelli Aleardi, Olivier Devillers, Gilles S...
TCS
2008
13 years 9 months ago
Modeling spiking neural networks
A notation for the functional specification of a wide range of neural networks consisting of temporal or non-temporal neurons, is proposed. The notation is primarily a mathematica...
Ioannis D. Zaharakis, Achilles D. Kameas