Sciweavers

1698 search results - page 332 / 340
» Growing Complex Games
Sort
View
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
15 years 4 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng
FSE
2005
Springer
108views Cryptology» more  FSE 2005»
15 years 3 months ago
Unbiased Random Sequences from Quasigroup String Transformations
Abstract. The need of true random number generators for many purposes (ranging from applications in cryptography and stochastic simulation, to search heuristics and game playing) i...
Smile Markovski, Danilo Gligoroski, Ljupco Kocarev
IUI
2004
ACM
15 years 3 months ago
Qualitative physics in virtual environments
In this paper, we describe a new approach to the creation of virtual environments, which uses qualitative physics to implement object behaviour. We adopted Qualitative Process The...
Marc Cavazza, Simon Hartley, Jean-Luc Lugrin, Mika...
FC
2004
Springer
89views Cryptology» more  FC 2004»
15 years 3 months ago
Electronic National Lotteries
We describe the design and implementation of secure and robust protocol and system for a national electronic lottery. Electronic lotteries at a national level are a viable cost eï¬...
Elisavet Konstantinou, Vasiliki Liagkou, Paul G. S...
CSFW
2003
IEEE
15 years 2 months ago
A Procedure for Verifying Security Against Type Confusion Attacks
A type confusion attack is one in which a principal accepts data of one type as data of another. Although it has been shown by Heather et al. that there are simple formatting conv...
Catherine Meadows