Sciweavers

59 search results - page 9 / 12
» Fast Computation on Encrypted Polynomials and Applications
Sort
View
WABI
2009
Springer
129views Bioinformatics» more  WABI 2009»
14 years 2 months ago
biRNA: Fast RNA-RNA Binding Sites Prediction
We present biRNA, a novel algorithm for prediction of binding sites between two RNAs based on minimization of binding free energy. Similar to RNAup approach [30], we assume the bin...
Hamidreza Chitsaz, Rolf Backofen, Süleyman Ce...
TGC
2007
Springer
14 years 1 months ago
Relational Analysis for Delivery of Services
Many techniques exist for statically computing properties of the evolution of processes expressed in process algebras. Static analysis has shown how to obtain useful results that c...
Flemming Nielson, Hanne Riis Nielson, Jörg Ba...
ESORICS
2005
Springer
14 years 1 months ago
Privacy Preserving Clustering
The freedom and transparency of information flow on the Internet has heightened concerns of privacy. Given a set of data items, clustering algorithms group similar items together...
Somesh Jha, Louis Kruger, Patrick McDaniel
CRYPTO
2010
Springer
162views Cryptology» more  CRYPTO 2010»
13 years 7 months ago
On Strong Simulation and Composable Point Obfuscation
The Virtual Black Box (VBB) property for program obfuscators provides a strong guarantee: Anything computable by an efficient adversary given the obfuscated program can also be co...
Nir Bitansky, Ran Canetti
FPL
2008
Springer
111views Hardware» more  FPL 2008»
13 years 9 months ago
Hyperreconfigurable architectures
Dynamically reconfigurable architectures or systems are able to reconfigure their function and/or structure to suit the changing needs of a computation during run time. The increa...
Sebastian Lange, Martin Middendorf