6142 search results - page 136 / 1229 » The Complexity of Partition Functions |
138
click to vote
EUROCRYPT
2005
Springer
15 years 9 months ago
2005
Springer
We revisit the following question: what are the minimal assumptions needed to construct statistically-hiding commitment schemes? Naor et al. show how to construct such schemes bas...
100
click to vote
ICCV
2001
IEEE
16 years 5 months ago
2001
IEEE
We introduce a new graph-theoretic approach to image segmentation based on minimizing a novel class of `mean cut' cost functions. Minimizing these cost functions corresponds ...
120
click to vote
JC
2006
15 years 3 months ago
2006
We give a correspondence between two notions of complexity for real numbers and functions: poly-time computability according to Ko and a notion that arises naturally when one cons...
113
click to vote
DAM
2007
15 years 3 months ago
2007
We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating f m(x) is small, independently of m and x. The ...
151
click to vote
IFL
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. In this paper we compare three systems for tracing and debugging Haskell programs: Freja, Hat and Hood. We evaluate their usefulness in practice by applying them to a num...