184 search results - page 20 / 37 » Querying Proofs |
PCM
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. A prototype basketball video retrieval system is presented in this report. Retrieval is based on the similarity of ball motion in the clip with that in the query. The sys...
AAAI
2006
13 years 9 months ago
2006
This report is an expanded version of a paper in AAAI-2006 proceedings. In this report, we investigate the challenges that must be addressed for the Semantic Web to become a feasi...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
CCS
2005
ACM
14 years 1 months ago
2005
ACM
This paper introduces the PeerAccess framework for reasoning about authorization in open distributed systems, and shows how a parameterization of the framework can be used to reas...
CIE
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...