4007 search results - page 128 / 802 » Computation with imprecise probabilities |
138
click to vote
CVPR
2003
IEEE
16 years 5 months ago
2003
IEEE
Probabilistic models have been adopted for many computer vision applications, however inference in highdimensional spaces remains problematic. As the statespace of a model grows, ...
150
click to vote
ALT
2003
Springer
16 years 13 days ago
2003
Springer
Solomonoff unified Occam’s razor and Epicurus’ principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field...
125
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...
159
Voted
ASIACRYPT
2011
Springer
14 years 3 months ago
2011
Springer
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
131
click to vote
DAC
2005
ACM
16 years 4 months ago
2005
ACM
As Si CMOS devices are scaled down into the nanoscale regime, current computer architecture approaches are reaching their practical limits. Future nano-architectures will confront...