693 search results - page 58 / 139 » Minimization and Partitioning Method Reducing Input Sets |
115
Voted
RP
2010
Springer
15 years 2 months ago
2010
Springer
We aim at finding a set of timing parameters for which a given timed automaton has a “good” behavior. We present here a novel approach based on the decomposition of the parame...
149
Voted
STACS
2007
Springer
15 years 10 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
157
Voted
EUROPAR
2004
Springer
15 years 7 months ago
2004
Springer
Hierarchical agglomerative clustering (HAC) is a common clustering method that outputs a dendrogram showing all N levels of agglomerations where N is the number of objects in the d...
127
Voted
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
We consider the task of dimensionality reduction for regression (DRR) whose goal is to find a low dimensional representation of input covariates, while preserving the statistical ...
108
Voted
CGF
2010
15 years 3 months ago
2010
While animation using barycentric coordinates or other automatic weight assignment methods has become a popular method for shape deformation, the global nature of the weights limi...