Sciweavers

868 search results - page 132 / 174
» Finding Most Likely Solutions
Sort
View
CRYPTO
2008
Springer
98views Cryptology» more  CRYPTO 2008»
13 years 9 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...
JETAI
2000
302views more  JETAI 2000»
13 years 7 months ago
Consciousness, intentionality and intelligence: some foundational issues for artificial intelligence
: We present three fundamental questions concerning minds. These are about consciousness, intentionality and intelligence. After we present the fundamental framework that has shape...
Murat Aydede, Guven Guzeldere
PODS
2009
ACM
100views Database» more  PODS 2009»
14 years 8 months ago
Space-optimal heavy hitters with strong error bounds
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...
Radu Berinde, Graham Cormode, Piotr Indyk, Martin ...
ICCV
1999
IEEE
14 years 20 hour ago
Camera Calibration and the Search for Infinity
This paper considers the problem of self-calibration of a camera from an image sequence in the case where the camera's internal parameters (most notably focal length) may cha...
Richard I. Hartley, Lourdes de Agapito, Ian D. Rei...
CPM
2006
Springer
145views Combinatorics» more  CPM 2006»
13 years 11 months ago
Approximation of RNA Multiple Structural Alignment
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...
Marcin Kubica, Romeo Rizzi, Stéphane Vialet...