2638 search results - page 298 / 528 » Random Geometric Complexes |
186
click to vote
EUROCRYPT
2009
Springer
16 years 7 months ago
2009
Springer
Almost any cryptographic scheme can be described by tweakable polynomials over GF(2), which contain both secret variables (e.g., key bits) and public variables (e.g., plaintext bit...
177
click to vote
ALT
2006
Springer
16 years 3 months ago
2006
Springer
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
173
click to vote
ACL
1994
15 years 7 months ago
1994
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...
252
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
We propose a novel tracking algorithm for the target of which geometric appearance changes drastically over time. To track it, we present a local patch-based appearance model and p...
163
click to vote
ICCV
1999
IEEE
16 years 8 months ago
1999
IEEE
In this contribution we focus on the calibration of very long image sequences from a hand-held camera that samples the viewing sphere of a scene. View sphere sampling is important...