Sciweavers

1016 search results - page 25 / 204
» Generalized distances between rankings
Sort
View
DM
1998
91views more  DM 1998»
13 years 9 months ago
On some relations between 2-trees and tree metrics
A tree function (TF) t on a ÿnite set X is a real function on the set of the pairs of elements of X satisfying the four-point condition: for all distinct x; y; z; w ∈ X; t(xy)+...
Bruno Leclerc, Vladimir Makarenkov
SIGMETRICS
2008
ACM
13 years 10 months ago
Network distance estimation with dynamic landmark triangles
This paper describes an efficient and accurate approach to estimate the network distance between arbitrary Internet hosts. We use three landmark hosts forming a triangle in two-di...
Zhihua Wen, Michael Rabinovich
SIGMOD
2008
ACM
111views Database» more  SIGMOD 2008»
14 years 10 months ago
Discovering bucket orders from full rankings
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
Jianlin Feng, Qiong Fang, Wilfred Ng
MSWIM
2005
ACM
14 years 3 months ago
Hop distances and flooding in wireless multihop networks with randomized beamforming
We show that randomized beamforming is a simple yet efficient communication strategy in wireless multihop networks if no neighbor location information is at hand. Already small an...
Robert Vilzmann, Christian Bettstetter, Daniel Med...
ICPR
2008
IEEE
14 years 11 months ago
Bregman distance to L1 regularized logistic regression
In this work we investigate the relationship between Bregman distances and regularized Logistic Regression model. We present a detailed study of Bregman Distance minimization, a f...
Mithun Das Gupta, Thomas S. Huang