2168 search results - page 82 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
108
Voted
MICCAI
2009
Springer
16 years 4 months ago
2009
Springer
Obtaining detailed, patient-specific blood flow information would be very useful in detecting and monitoring cardio-vascular diseases. Current approaches rely on computational flui...
117
Voted
CRYPTO
2007
Springer
15 years 9 months ago
2007
Springer
In this paper we identify the (P, Q)-DDH assumption, as an extreme, powerful generalization of the Decisional Diffie-Hellman (DDH) assumption: virtually all previously proposed gen...
136
Voted
GLOBECOM
2006
IEEE
15 years 9 months ago
2006
IEEE
—Several dynamic call admission control (CAC) schemes for cellular networks have been proposed in the literature to reserve resources adaptively to provide the desired quality of...
123
Voted
TCC
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...
274
Voted
JMLR
2012
13 years 6 months ago
2012
This paper considers additive factorial hidden Markov models, an extension to HMMs where the state factors into multiple independent chains, and the output is an additive function...