Sciweavers

645 search results - page 9 / 129
» On-line Learning and the Metrical Task System Problem
Sort
View
STOC
2003
ACM
130views Algorithms» more  STOC 2003»
14 years 8 months ago
A tight bound on approximating arbitrary metrics by tree metrics
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
CVPR
2005
IEEE
14 years 9 months ago
Learning a Similarity Metric Discriminatively, with Application to Face Verification
We present a method for training a similarity metric from data. The method can be used for recognition or verification applications where the number of categories is very large an...
Sumit Chopra, Raia Hadsell, Yann LeCun
ECRTS
1998
IEEE
13 years 12 months ago
Using exact feasibility tests for allocating real-time tasks in multiprocessor systems
This paper introduces improvements in partitioning schemes for multiprocessor real-time systems which allow higher processor utilization and enhanced schedulability by using exact...
Sergio Saez, Joan Vila i Carbó, Alfons Cres...
WSOM
2009
Springer
14 years 2 months ago
Incremental Figure-Ground Segmentation Using Localized Adaptive Metrics in LVQ
Vector quantization methods are confronted with a model selection problem, namely the number of prototypical feature representatives to model each class. In this paper we present a...
Alexander Denecke, Heiko Wersing, Jochen J. Steil,...
DAGM
2007
Springer
14 years 1 months ago
The Minimum Volume Ellipsoid Metric
We propose an unsupervised “local learning” algorithm for learning a metric in the input space. Geometrically, for a given query point, the algorithm finds the minimum volume ...
Karim T. Abou-Moustafa, Frank P. Ferrie