1826 search results - page 218 / 366 » Using Random Forests in the Structured Language Model |
160
Voted
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We present the first uniquely represented data structure for an external memory model of computation, a B-tree analogue called a B-treap. Uniquely represented data structures repre...
150
click to vote
LICS
2005
IEEE
15 years 12 months ago
2005
IEEE
The theme of this paper is profunctors, and their centrality and ubiquity in understanding concurrent computation. Profunctors (a.k.a. distributors, or bimodules) are a generalisa...
176
Voted
IFM
2007
Springer
16 years 14 days ago
2007
Springer
We present an approach to modelling Abadi–Cardelli-style object calculi as Unifying Theories of Programming (UTP) designs. Here we provide a core object calculus with an operatio...
170
click to vote
NIPS
2008
15 years 7 months ago
2008
We explore a new Bayesian model for probabilistic grammars, a family of distributions over discrete structures that includes hidden Markov models and probabilistic context-free gr...
171
Voted
SASO
2009
IEEE
16 years 1 months ago
2009
IEEE
This paper introduces MOCAS (Model Of Components for Adaptive Systems), a generic state-based component model which enables the self-adaptation of software components together wit...