Sciweavers

3946 search results - page 444 / 790
» The computational complexity of choice sets
Sort
View
COLING
2010
15 years 1 months ago
A Monolingual Tree-based Translation Model for Sentence Simplification
In this paper, we consider sentence simplification as a special form of translation with the complex sentence as the source and the simple sentence as the target. We propose a Tre...
Zhemin Zhu, Delphine Bernhard, Iryna Gurevych
DISOPT
2011
201views Education» more  DISOPT 2011»
14 years 10 months ago
The Wiener maximum quadratic assignment problem
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional poi...
Eranda Çela, Nina S. Schmuck, Shmuel Wimer,...
JMLR
2012
13 years 9 months ago
SpeedBoost: Anytime Prediction with Uniform Near-Optimality
We present SpeedBoost, a natural extension of functional gradient descent, for learning anytime predictors, which automatically trade computation time for predictive accuracy by s...
Alexander Grubb, Drew Bagnell
CCGRID
2009
IEEE
15 years 10 months ago
Experiment and Workflow Management Using Cyberaide Shell
In recent years the power of Grid computing has grown exponentially through the development of advanced middleware systems. While usage has increased, the penetration of Grid compu...
Gregor von Laszewski, Andrew J. Younge, Xi He, Kum...
FDG
2009
ACM
15 years 11 months ago
Affective game engines: motivation and requirements
The tremendous advances in gaming technologies over the past decade have focused primarily on the physical realism of the game environment and game characters, and the complexity ...
Eva Hudlicka