6142 search results - page 182 / 1229 » The Complexity of Partition Functions |
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
We consider several questions inspired by the direct-sum problem in (two-party) communication complexity. In all questions, there are k fixed Boolean functions f1, . . . , fk and ...
147
click to vote
WSCG
2003
15 years 4 months ago
2003
The registration of 3D form features is essential to the supporting of reverse shape design processes. Extracting an editable shape feature from unordered data points is notorious...
133
click to vote
ECCC
2010
15 years 3 months ago
2010
An errorless circuit for a boolean function is one that outputs the correct answer or "don't know" on each input (and never outputs the wrong answer). The goal of e...
137
Voted
IAT
2008
IEEE
15 years 3 months ago
2008
IEEE
TD-FALCON (Temporal Difference - Fusion Architecture for Learning, COgnition, and Navigation) is a class of self-organizing neural networks that incorporates Temporal Difference (...
161
click to vote
FSTTCS
2005
Springer
15 years 9 months ago
2005
Springer
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...