5608 search results - page 1041 / 1122 » On the Theory of Matchgate Computations |
128
click to vote
ALT
1995
Springer
15 years 5 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...
123
click to vote
SWAT
2000
Springer
15 years 5 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...
115
click to vote
ACMDIS
2008
ACM
15 years 3 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 ...
111
click to vote
CCS
2008
ACM
15 years 3 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...
106
click to vote
CHI
2008
ACM
15 years 3 months ago
2008
ACM
As emphasis is placed on developing mobile, educational, and other applications that minimize cognitive load on users, it is becoming more essential to base interface design on im...