535 search results - page 44 / 107 » Do we need dependent types |
RANDOM
1997
Springer
13 years 12 months ago
1997
Springer
The current proof of the PCP Theorem (i.e., NP = PCP(log, O(1))) is very complicated. One source of difficulty is the technically involved analysis of low-degree tests. Here, we r...
IPPS
1998
IEEE
13 years 12 months ago
1998
IEEE
Characterizing shared-memory applications provides insight to design efficient systems, and provides awareness to identify and correct application performance bottlenecks. Configu...
AIME
2001
Springer
14 years 7 days ago
2001
Springer
To cope with the difficulty of MRI brain scans automatic segmentation, we need to constrain and control the selection and the adjustment of processing tools depending on the local ...
COLT
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. There has been growing interest in practice in using unlabeled data together with labeled data in machine learning, and a number of different approaches have been develo...
CADE
2003
Springer
14 years 8 months ago
2003
Springer
Foundational certified code systems seek to prove untrusted programs to be safe relative to safety policies given in terms of actual machine architectures, thereby improving the s...