Sciweavers

1690 search results - page 56 / 338
» Applications of Metric Coinduction
Sort
View
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
14 years 10 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
14 years 10 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
14 years 10 months ago
Nonlinear adaptive distance metric learning for clustering
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
Jianhui Chen, Zheng Zhao, Jieping Ye, Huan Liu
CORR
2007
Springer
122views Education» more  CORR 2007»
13 years 10 months ago
How to Complete a Doubling Metric
In recent years, considerable advances have been made in the study of properties of metric spaces in terms of their doubling dimension. This line of research has not only enhanced...
Anupam Gupta, Kunal Talwar
INFOCOM
2007
IEEE
14 years 4 months ago
Routing with a Markovian Metric to Promote Local Mixing
— Routing protocols have traditionally been based on finding shortest paths under certain cost metrics. A conventional routing metric models the cost of a path as the sum of the...
Yunnan Wu, Saumitra M. Das, Ranveer Chandra