Sciweavers

157
Voted
TCS
2008
15 years 11 days ago
Algorithms for subsequence combinatorics
A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...
Cees H. Elzinga, Sven Rahmann, Hui Wang
TCS
2008
15 years 11 days 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
TCS
2008
15 years 11 days ago
GemCell: A generic platform for modeling multi-cellular biological systems
The mass and complexity of biological information requires computer-aided simulation and analysis to help scientists achieve understanding and guide experimentation. Although livi...
Hila Amir-Kroll, Avital Sadot, Irun R. Cohen, Davi...
TCS
2008
15 years 11 days 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
Theoretical Computer Science
Top of PageReset Settings