Sciweavers

2479 search results - page 472 / 496
» Quantum complexity theory
Sort
View
CF
2007
ACM
14 years 29 days ago
Parallel genomic sequence-search on a massively parallel system
In the life sciences, genomic databases for sequence search have been growing exponentially in size. As a result, faster sequencesearch algorithms to search these databases contin...
Oystein Thorsen, Brian E. Smith, Carlos P. Sosa, K...
STOC
2010
ACM
185views Algorithms» more  STOC 2010»
14 years 27 days ago
Measuring independence of datasets
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
Vladimir Braverman, Rafail Ostrovsky
SOUPS
2010
ACM
14 years 26 days ago
Parenting from the pocket: value tensions and technical directions for secure and private parent-teen mobile safety
An increasing number of high-tech devices, such as driver monitoring systems and Internet usage monitoring tools, are advertised as useful or even necessary for good parenting of ...
Alexei Czeskis, Ivayla Dermendjieva, Hussein Yapit...
EMSOFT
2009
Springer
14 years 25 days ago
Modular static scheduling of synchronous data-flow networks: an efficient symbolic representation
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
Marc Pouzet, Pascal Raymond
ACMSE
2006
ACM
14 years 22 days ago
Achieving efficient polynomial multiplication in fermat fields using the fast Fourier transform
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...
Selçuk Baktir, Berk Sunar