115 search results - page 12 / 23 » How to Drive a B Machine |
143
Voted
ACL
1990
15 years 3 months ago
1990
We define a set of deterministic bottom-up left to right parsers which analyze a subset of Tree Adjoining Languages. The LR parsing strategy for Context Free Grammars is extended ...
110
Voted
CHI
2011
ACM
14 years 5 months ago
2011
ACM
This article is a modified version of the paper published at CHI 2011 [11]. For more details about the study, please refer to the original paper. We report our study on mobile rem...
123
Voted
ICML
2003
IEEE
16 years 2 months ago
2003
IEEE
We investigate how stack filter function classes like weighted order statistics can be applied to classification problems. This leads to a new design criteria for linear classifie...
112
Voted
ML
1998
ACM
15 years 1 months ago
1998
ACM
Following Tesauro’s work on TD-Gammon, we used a 4000 parameter feed-forward neural network to develop a competitive backgammon evaluation function. Play proceeds by a roll of t...
110
click to vote
SIGMETRICS
1997
ACM
15 years 6 months ago
1997
ACM
In this paper we present a performance study of memory reference behavior in network protocol processing, using an Internet-based protocol stack implemented in the x-kernel runnin...