Sciweavers

9818 search results - page 327 / 1964
» Much Support and More
Sort
View
ACL
2006
15 years 8 months ago
Learning Accurate, Compact, and Interpretable Tree Annotation
We present an automatic approach to tree annotation in which basic nonterminal symbols are alternately split and merged to maximize the likelihood of a training treebank. Starting...
Slav Petrov, Leon Barrett, Romain Thibaux, Dan Kle...
AIPS
2006
15 years 8 months ago
Resource Contention Metrics for Oversubscribed Scheduling Problems
We investigate a task insertion heuristic for oversubscribed scheduling problems, max-availability, that uses a simple estimate of resource contention to assign tasks to intervals...
Laurence A. Kramer, Stephen F. Smith
DMDW
2001
194views Management» more  DMDW 2001»
15 years 8 months ago
Logical Multidimensional Database Design for Ragged and Unbalanced Aggregation
Research on logical design of OLAP cubes has tended to assume that the rollup hierarchy in a cube dimension takes the form of a balanced tree. However, experience from industry in...
Tapio Niemi, Jyrki Nummenmaa, Peter Thanisch
IJCAI
2001
15 years 8 months ago
Computational Complexity of Planning with Temporal Goals
In the last decade, there has been several studies on the computational complexity of planning. These studies normally assume that the goal of planning is to make a certain fluent...
Chitta Baral, Vladik Kreinovich, Raul Trejo
NAACL
2004
15 years 8 months ago
Speed and Accuracy in Shallow and Deep Stochastic Parsing
This paper reports some experiments that compare the accuracy and performance of two stochastic parsing systems. The currently popular Collins parser is a shallow parser whose out...
Ronald M. Kaplan, Stefan Riezler, Tracy H. King, J...