Sciweavers

426 search results - page 49 / 86
» Run lengths and liquidity
Sort
View
SPAA
2004
ACM
14 years 3 months ago
On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs
A key capability of data-race detectors is to determine whether one thread executes logically in parallel with another or whether the threads must operate in series. This paper pr...
Michael A. Bender, Jeremy T. Fineman, Seth Gilbert...
CRYPTO
2008
Springer
98views Cryptology» more  CRYPTO 2008»
13 years 11 months ago
One-Time Programs
Abstract. In this work, we introduce one-time programs, a new computational paradigm geared towards security applications. A one-time program can be executed on a single input, who...
Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothbl...
CRYPTO
2010
Springer
208views Cryptology» more  CRYPTO 2010»
13 years 11 months ago
Improved Delegation of Computation Using Fully Homomorphic Encryption
Following Gennaro, Gentry, and Parno (Cryptology ePrint Archive 2009/547), we use fully homomorphic encryption to design improved schemes for delegating computation. In such schem...
Kai-Min Chung, Yael Kalai, Salil P. Vadhan
BMCBI
2008
211views more  BMCBI 2008»
13 years 10 months ago
CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment
Background: Searching for similarities in protein and DNA databases has become a routine procedure in Molecular Biology. The Smith-Waterman algorithm has been available for more t...
Svetlin Manavski, Giorgio Valle
ICPR
2004
IEEE
14 years 11 months ago
Parallelizing Motion Segmentation by Perceptual Organization of XYT
The front end of many motion analysis algorithms is usually a process that generates bounding boxes around each moving object, roughly segmenting the objects from the background. ...
Daniel Majchrzak, Sudeep Sarkar