2254 search results - page 44 / 451 » Computing the minimal covering set |
CSDA
2008
15 years 25 days ago
2008
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 ...
ACL
2009
14 years 10 months ago
2009
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 ...
72
Voted
GD
2009
Springer
15 years 5 months ago
2009
Springer
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....
104
click to vote
CVPR
2007
IEEE
16 years 2 months ago
2007
IEEE
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...
100
click to vote
LWA
2004
15 years 2 months ago
2004
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...