Sciweavers

1488 search results - page 198 / 298
» A Probabilistic Segmentation Scheme
Sort
View
CVIU
2011
14 years 10 months ago
Single and sparse view 3D reconstruction by learning shape priors
In this paper, we aim to reconstruct free-form 3D models from only one or few silhouettes by learning the prior knowledge of a specific class of objects. Instead of heuristically...
Yu Chen, Roberto Cipolla
CVPR
2012
IEEE
13 years 9 months ago
Robust visual tracking using autoregressive hidden Markov Model
Recent studies on visual tracking have shown significant improvement in accuracy by handling the appearance variations of the target object. Whereas most studies present schemes ...
Dong Woo Park, Junseok Kwon, Kyoung Mu Lee
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
16 years 6 months ago
Towards 3-query locally decodable codes of subexponential length
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
SIGMOD
2008
ACM
138views Database» more  SIGMOD 2008»
16 years 6 months ago
Sampling time-based sliding windows in bounded space
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
Rainer Gemulla, Wolfgang Lehner
EUROCRYPT
1999
Springer
15 years 10 months ago
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...
Pascal Paillier