71 search results - page 14 / 15 » Computationally Private Randomizing Polynomials and Their Ap... |
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
CCECE
2009
IEEE
14 years 2 months ago
2009
IEEE
A complex system is expected to show different nominal behaviors under different conditions, and the deviation over time from these nominal behaviors is an indicator of potential ...
WABI
2009
Springer
14 years 2 months ago
2009
Springer
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...
TWC
2008
13 years 7 months ago
2008
With the capability of supporting very high data rate services in a short range, Ultra-Wideband (UWB) technology is appealing to multimedia applications in future wireless personal...
CC
2008
Springer
13 years 7 months ago
2008
Springer
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...