2436 search results - page 81 / 488 » Comonadic Notions of Computation |
100
Voted
DAWAK
2006
Springer
15 years 7 months ago
2006
Springer
The main idea of iceberg data cubing methods relies on optimization techniques for computing only the cuboids cells above certain minimum support threshold. Even using such approac...
135
Voted
AML
1998
15 years 3 months ago
1998
The paper builds on both a simply typed term system PRω and a computation model on Scott domains via so-called parallel typed while programs (PTWP). The former provides a notion ...
118
Voted
STOC
2007
ACM
16 years 4 months ago
2007
ACM
A zero-knowledge proof allows a prover to convince a verifier of an assertion without revealing any further information beyond the fact that the assertion is true. Secure multipar...
139
Voted
IWANN
2009
Springer
15 years 10 months ago
2009
Springer
We survey on the theoretical and practical developments of the theory of fuzzy logic and soft computing. Specifically, we briefly review the history and main milestones of fuzzy ...
155
Voted
ICALP
1997
Springer
15 years 8 months ago
1997
Springer
In the 1980's, Bennett introduced computational depth as a formal measure of the amount of computational history that is evident in an object's structure. In particular,...