Sciweavers

1578 search results - page 177 / 316
» Algorithmic randomness of continuous functions
Sort
View
ASIACRYPT
2011
Springer
12 years 9 months ago
Short Signatures from Weaker Assumptions
We provide constructions of (m, 1)-programmable hash functions (PHFs) for m ≥ 2. Mimicking certain programmability properties of random oracles, PHFs can, e.g., be plugged into ...
Dennis Hofheinz, Tibor Jager, Eike Kiltz
CVPR
2012
IEEE
11 years 11 months ago
Multiclass pixel labeling with non-local matching constraints
A popular approach to pixel labeling problems, such as multiclass image segmentation, is to construct a pairwise conditional Markov random field (CRF) over image pixels where the...
Stephen Gould
TMC
2011
127views more  TMC 2011»
13 years 3 months ago
Discriminant Minimization Search for Large-Scale RF-Based Localization Systems
— In large-scale fingerprinting localization systems, fine-grained location estimation and quick location determination are conflicting concerns. To achieve finer-grained loc...
Sheng-Po Kuo, Yu-Chee Tseng
ICML
2010
IEEE
13 years 10 months ago
Inverse Optimal Control with Linearly-Solvable MDPs
We present new algorithms for inverse optimal control (or inverse reinforcement learning, IRL) within the framework of linearlysolvable MDPs (LMDPs). Unlike most prior IRL algorit...
Dvijotham Krishnamurthy, Emanuel Todorov
CVPR
1999
IEEE
14 years 11 months ago
Radiometric Self Calibration
A simple algorithm is described that computes the radiometric responsefunction of an imaging system,from images of an arbitrar), scene taken using different exposures. The exposur...
Tomoo Mitsunaga, Shree K. Nayar