Sciweavers

19866 search results - page 174 / 3974
» Computing all factorizations in ***
Sort
View
STACS
1992
Springer
15 years 10 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...
BMCBI
2007
148views more  BMCBI 2007»
15 years 6 months ago
fREDUCE: Detection of degenerate regulatory elements using correlation with expression
Background: The precision of transcriptional regulation is made possible by the specificity of physical interactions between transcription factors and their cognate binding sites ...
Randy Z. Wu, Christina Chaivorapol, Jiashun Zheng,...
CHI
2009
ACM
16 years 7 months ago
Usability, playability, and long-term engagement in computer games
Does usability affect long term user engagement in computer games, or are other factors more influential? This paper explores this issue, discussing an evaluation study that measu...
Alessandro Febretti, Franca Garzotto
MOC
2000
78views more  MOC 2000»
15 years 6 months ago
Using number fields to compute logarithms in finite fields
We describe an adaptation of the number field sieve to the problem of computing logarithms in a finite field. We conjecture that the running time of the algorithm, when restricted ...
Oliver Schirokauer
FCS
2006
15 years 8 months ago
Cryptographic and Computational Challenges in Grid Computing
A computational grid is a large-scale distributed computing environment capable of providing dependable, consistent, pervasive, and inexpensive access to high-end computational re...
Song Y. Yan, Glyn James, Gongyi Wu