1089 search results - page 27 / 218 » Randomness and Reducibility |
122
click to vote
PODS
2012
ACM
13 years 2 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
TCS
1998
14 years 11 months ago
1998
Results on random oracles typically involve showing that a class {X : P(X)} has Lebesgue measure one, i.e., that some property P(X) holds for “almost every X.” A potentially m...
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
We boost the efficiency and robustness of distributionbased matching by random subsampling which results in the minimum number of samples required to achieve a specified probabili...
121
click to vote
STOC
2005
ACM
16 years 3 days ago
2005
ACM
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
ISCAS
2007
IEEE
15 years 6 months ago
2007
IEEE
—Multi-view video coding is becoming a very active research topic, as multi-view video system provides the interactive feature which makes viewers experience the free viewpoint n...