Sciweavers

26071 search results - page 109 / 5215
» Making
Sort
View
114
Voted
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
15 years 9 months ago
Making Chord Robust to Byzantine Attacks
Chord is a distributed hash table (DHT) that requires only O(logn) links per node and performs searches with latency and message cost O(logn), where n is the number of peers in the...
Amos Fiat, Jared Saia, Maxwell Young
111
Voted
ICCS
2005
Springer
15 years 9 months ago
What Makes the Arc-Preserving Subsequence Problem Hard?
Abstract. Given two arc-annotated sequences (S, P) and (T, Q) representing RNA structures, the Arc-Preserving Subsequence (APS) problem asks whether (T, Q) can be obtained from (S,...
Guillaume Blin, Guillaume Fertin, Romeo Rizzi, St&...
112
Voted
INTETAIN
2005
Springer
15 years 9 months ago
Getting the Story Right: Making Computer-Generated Stories More Entertaining
Abstract. In this paper we describe our efforts to increase the entertainment value of the stories generated by our story generation system, the Virtual Storyteller, at the levels...
Katri Oinonen, Mariët Theune, Anton Nijholt, ...