6142 search results - page 41 / 1229 » The Complexity of Partition Functions |
160
click to vote
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. A Solovay function is a computable upper bound g for prefixfree Kolmogorov complexity K that is nontrivial in the sense that g agrees with K, up to some additive constan...
128
click to vote
MFCS
1990
Springer
15 years 10 months ago
1990
Springer
We introduce the notion of associative one-way functions and prove that they exist if and only if P 6= NP. As evidence of their utility, we present two novel protocols that apply ...
167
click to vote
QCQC
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of partic...
146
click to vote
ECCV
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. In this paper we develop an algorithm for structured prediction that optimizes against complex performance measures, those which are a function of false positive and fals...
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this chapter, we propose a new practical codification of the elements of the Venn diagram in order to easily manipulate the focal elements. In order to reduce the complexity, t...