Sciweavers

2489 search results - page 55 / 498
» On the Subgroup Distance Problem
Sort
View
145
Voted
JMLR
2012
13 years 6 months ago
Distance Metric Learning with Eigenvalue Optimization
The main theme of this paper is to develop a novel eigenvalue optimization framework for learning a Mahalanobis metric. Within this context, we introduce a novel metric learning a...
Yiming Ying, Peng Li
COCOC
1995
150views Combinatorics» more  COCOC 1995»
15 years 7 months ago
On Central Spanning Trees of a Graph
We consider the collection of all spanning trees of a graph with distance between them based on the size of the symmetric difference of their edge sets. A central spanning tree o...
Sergei L. Bezrukov, Firoz Kaderali, W. Poguntke
119
Voted
DCC
2002
IEEE
15 years 3 months ago
Bounds on the Covering Radius of Linear Codes
Asymptotically bounding the covering radius in terms of the dual distance is a well-studied problem. We will combine the polynomial approach with estimates of the distance distribu...
Alexei E. Ashikhmin, Alexander Barg
125
Voted
PSD
2004
Springer
132views Database» more  PSD 2004»
15 years 9 months ago
Computational Experiments with Minimum-Distance Controlled Perturbation Methods
Minimum-distance controlled perturbation is a recent family of methods for the protection of statistical tabular data. These methods are both efficient and versatile, since can dea...
Jordi Castro
149
Voted
IAT
2009
IEEE
15 years 7 months ago
Confusion and Distance Metrics as Performance Criteria for Hierarchical Classification Spaces
When intelligent systems reason about complex problems with a large hierarchical classification space it is hard to evaluate system performance. For classification problems, differ...
Wilbert van Norden, Catholijn M. Jonker