2489 search results - page 190 / 498 » On the Subgroup Distance Problem |
133
click to vote
AAIM
2008
Springer
15 years 11 months ago
2008
Springer
The Kemeny Score problem is central to many applications in the context of rank aggregation. Given a set of permutations (votes) over a set of candidates, one searches for a “con...
116
click to vote
COLT
2007
Springer
15 years 10 months ago
2007
Springer
When comparing discrete probability distributions, natural measures of similarity are not p distances but rather are informationdivergences such as Kullback-Leibler and Hellinger. ...
137
click to vote
NETCOOP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper discusses an optimization-based approach for congestion control together with multipath routing in a TCP/IP network. In recent research we have shown how natur...
127
click to vote
STACS
2007
Springer
15 years 10 months ago
2007
Springer
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...
131
click to vote
ICDCSW
2006
IEEE
15 years 10 months ago
2006
IEEE
Network coordinates, which embed network distance measurements in a coordinate system, were introduced as a method for determining the proximity of nodes for routing table updates...