8874 search results - page 1710 / 1775 » A New Implementation of Automath |
126
Voted
ATMOS
2007
15 years 5 months ago
2007
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
117
Voted
APPROX
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
129
Voted
AAAI
2010
15 years 5 months ago
2010
g Without a Heuristic: Efficient Use of Abstraction Bradford Larsen, Ethan Burns, Wheeler Ruml Department of Computer Science University of New Hampshire Durham, NH 03824 USA blars...
116
Voted
ACL
2008
15 years 5 months ago
2008
We investigate the tasks of general morphological tagging, diacritization, and lemmatization for Arabic. We show that for all tasks we consider, both modeling the lexeme explicitl...
154
click to vote
BCS
2008
15 years 5 months ago
2008
In this work, a new algorithm is proposed for fast estimation of nonparametric multivariate kernel density, based on principal direction divisive partitioning (PDDP) of the data s...