Sciweavers

2254 search results - page 44 / 451
» Computing the minimal covering set
Sort
View
CSDA
2008
65views more  CSDA 2008»
13 years 10 months ago
Improving updating rules in multiplicative algorithms for computing D-optimal designs
In this paper we discuss a class of multiplicative algorithms for computing D-optimal designs for regression models on a finite design space. We prove a monotonicity result for a ...
Holger Dette, Andrey Pepelyshev, Anatoly A. Zhiglj...
ACL
2009
13 years 7 months ago
Minimized Models for Unsupervised Part-of-Speech Tagging
We describe a novel method for the task of unsupervised POS tagging with a dictionary, one that uses integer programming to explicitly search for the smallest model that explains ...
Sujith Ravi, Kevin Knight
GD
2009
Springer
14 years 2 months ago
On the Characterization of Level Planar Trees by Minimal Patterns
We consider characterizations of level planar trees. Healy et al. [8] characterized the set of trees that are level planar in terms of two minimal level non-planar (MLNP) patterns....
Alejandro Estrella-Balderrama, J. Joseph Fowler, S...
CVPR
2007
IEEE
14 years 12 months ago
A Quasi-Minimal Model for Paper-Like Surfaces
Smoothly bent paper-like surfaces are developable. They are however difficult to minimally parameterize since the number of meaningful parameters is intrinsically dependent on the...
Mathieu Perriollat, Adrien Bartoli
LWA
2004
13 years 11 months ago
Modeling Rule Precision
This paper reports first results of an empirical study of the precision of classification rules on an independent test set. We generated a large number of rules using a general co...
Johannes Fürnkranz