Sciweavers

5699 search results - page 263 / 1140
» Alternating model trees
Sort
View
ICIP
2007
IEEE
16 years 9 months ago
Statistically Driven Sparse Image Approximation
Finding the sparsest approximation of an image as a sum of basis functions drawn from a redundant dictionary is an NPhard problem. In the case of a dictionary whose elements form ...
Rosa M. Figueras i Ventura, Eero P. Simoncelli
WSC
2001
15 years 8 months ago
Simulation and analysis of dealers' returns distribution strategy
Due to high demand uncertainty, excess inventory has been a key issue in inventory control. Caterpillar developed the dealers' parts inventory sharing (DPIS) and returns prog...
Hui Zhao
AUTOMATICA
2007
104views more  AUTOMATICA 2007»
15 years 7 months ago
Improving off-line approach to robust MPC based-on nominal performance cost
This paper gives two alternative off-line synthesis approaches to robust model predictive control (RMPC) for systems with polytopic description. In each approach, a sequence of ex...
BaoCang Ding, YuGeng Xi, Marcin T. Cychowski, Thom...
ACL
2001
15 years 8 months ago
What is the Minimal Set of Fragments that Achieves Maximal Parse Accuracy?
We aim at finding the minimal set of fragments which achieves maximal parse accuracy in Data Oriented Parsing. Experiments with the Penn Wall Street Journal treebank show that cou...
Rens Bod
EACL
2003
ACL Anthology
15 years 8 months ago
Well-Nested Parallelism Constraints for Ellipsis Resolution
The Constraint Language for Lambda Structures (CLLS) is an expressive tree description language. It provides a uniform framework for underspecified semantics, covering scope, ell...
Katrin Erk, Joachim Niehren