6142 search results - page 352 / 1229 » The Complexity of Partition Functions |
184
click to vote
GIS
1998
ACM
15 years 7 months ago
1998
ACM
This paper describes the implementation of a triangulation based collapse algorithm in the general-purpose object oriented DBMS Magnum. The contribution of the paper is twofold. F...
217
Voted
EUROCRYPT
2004
Springer
16 years 26 days ago
2004
Springer
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
181
click to vote
TIT
1998
15 years 7 months ago
1998
We show that if the closureof a function class F under the metric induced by some probability distribution is not convex, then the sample complexity for agnostically learning F wi...
177
click to vote
AML
2004
15 years 7 months ago
2004
The standard method of generating countable ordinals from uncountable ordinals can be replaced by a use of fixed point extractors available in the term calculus of Howard's s...
200
Voted
CG
2004
Springer
15 years 7 months ago
2004
Springer
The Binet formula gives a natural way for Fibonacci numbers to be viewed as a function of a complex variable. We experimentally study the complex dynamics of the Fibonacci numbers...