8512 search results - page 1606 / 1703 » Computing Theory With Relevance |
COLT
2006
Springer
13 years 12 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
ALT
1995
Springer
13 years 11 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
SWAT
2000
Springer
13 years 11 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
ACMDIS
2008
ACM
13 years 10 months ago
2008
ACM
This paper reports the trial of a wearable data capture device, SenseCam, as a resource for digital narratives and uses data from the trial to reflect on the models of the ,,mind ...
CCS
2008
ACM
13 years 10 months ago
2008
ACM
Distance bounding protocols have been proposed for many security critical applications as a means of getting an upper bound on the physical distance to a communication partner. As...