1809 search results - page 20 / 362 » Weakly Computable Real Numbers |
CCA
2005
Springer
13 years 9 months ago
2005
Springer
If one wishes to find out whether a computational problem over discrete data is solvable or how complex it is, the classical approach is to represent the discrete objects in quest...
AMFG
2005
IEEE
14 years 1 months ago
2005
IEEE
It has been shown that features can be selected adaptively for object tracking in changing environments [1]. We propose to use the variance of Mutual Information [2] for online fea...
AAAI
1990
13 years 8 months ago
1990
Troubleshooting problems in real manufacturing environments impose constraints on admissible solutions that make the computational solutions offered by "troubleshooting from ...
GG
2008
Springer
13 years 8 months ago
2008
Springer
The tautology problem is the problem to prove the validity of statements. In this paper, we present a calculus for this undecidable problem on graphical conditions, prove its sound...
CRYPTO
2005
Springer
14 years 1 months ago
2005
Springer
Since bit and string oblivious transfer and commitment, two primitives of paramount importance in secure two- and multi-party computation, cannot be realized in an unconditionally ...