9841 search results - page 393 / 1969 » Distributed Value Functions |
185
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
The parallel repetition theorem states that for any two provers one round game with value at most 1 − (for < 1/2), the value of the game repeated n times in parallel is at mo...
186
Voted
CIS
2005
Springer
16 years 9 days ago
2005
Springer
In this paper, a new approach on image registration is presented. We introduce a novel conception- normal vector information (NVI) - to evaluate the similarity between two images. ...
178
Voted
ECCC
2010
15 years 6 months ago
2010
The parallel repetition theorem states that for any Two Prover Game with value at most 1 - (for < 1/2), the value of the game repeated n times in parallel is at most (1 - 3 )(n...
160
click to vote
KDD
2009
ACM
2009
ACM
Quantification and semi-supervised classification methods for handling changes in class distribution
16 years 7 months ago
In realistic settings the prevalence of a class may change after a classifier is induced and this will degrade the performance of the classifier. Further complicating this scenari...
180
click to vote
ICPP
2006
IEEE
16 years 24 days ago
2006
IEEE
Widely adopted distributor-based systems forward user requests to a balanced set of waiting servers in complete transparency to the users. The policy employed in forwarding reques...