494 search results - page 55 / 99 » Heap Building Bounds |
IJCAI
2003
15 years 11 days ago
2003
Often the most expensive and time-consuming task in building a pattern recognition system is col lecting and accurately labeling training and testing data. In this paper, we exp...
115
click to vote
UAI
2004
15 years 11 days ago
2004
Exponential models of distributions are widely used in machine learning for classification and modelling. It is well known that they can be interpreted as maximum entropy models u...
105
click to vote
UAI
1998
15 years 10 days ago
1998
This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method. In these app...
102
click to vote
ACL
1996
15 years 9 days ago
1996
In this paper 1 we present a new parsing algorithm for linear indexed grammars (LIGs) in the same spirit as the one described in (Vijay-Shanker and Weir, 1993) for tree adjoining ...
ACL
1990
15 years 4 days ago
1990
This paper presents an implemented, psychologicallyplausible parsing model for Government Binding theory grammars. I make use of two main ideas: (1) a generalization of the licens...