1016 search results - page 25 / 204 » Generalized distances between rankings |
91
Voted
DM
1998
15 years 11 days ago
1998
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)+...
98
Voted
SIGMETRICS
2008
ACM
15 years 18 days ago
2008
ACM
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...
193
click to vote
SIGMOD
2008
ACM
16 years 25 days ago
2008
ACM
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...
MSWIM
2005
ACM
15 years 6 months ago
2005
ACM
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...
93
Voted
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
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...