Sciweavers

202 search results - page 16 / 41
» Counting Distance Permutations
Sort
View
ICC
2008
IEEE
141views Communications» more  ICC 2008»
14 years 3 months ago
Greedy Hop Distance Routing Using Tree Recovery on Wireless Ad Hoc and Sensor Networks
—Connectivity-based routing protocols use the hop count vector to a group of anchors for packet forwarding. Due to the discrete nature of hop count based coordinates, without an ...
Shao Tao, Akkihebbal L. Ananda, Mun Choon Chan
COMPGEOM
2004
ACM
14 years 2 months ago
On distinct distances from a vertex of a convex polygon
Given a set P of n points in convex position in the plane, we prove that there exists a point p ∈ P such that the number of distinct distances from p is at least (13n−6)/36 . ...
Adrian Dumitrescu
TIT
2008
68views more  TIT 2008»
13 years 8 months ago
Signaling Over Arbitrarily Permuted Parallel Channels
The problem of transmission of information over arbitrarily permuted parallel channels is studied here. The transmitter does not know over which channel a certain codesequence will...
Frans M. J. Willems, Alexei Gorokhov
WWW
2010
ACM
14 years 4 months ago
Generalized distances between rankings
Spearman’s footrule and Kendall’s tau are two well established distances between rankings. They, however, fail to take into account concepts crucial to evaluating a result set...
Ravi Kumar, Sergei Vassilvitskii
MT
2010
110views more  MT 2010»
13 years 7 months ago
Metrics for MT evaluation: evaluating reordering
Translating between dissimilar languages requires an account of the use of divergent word orders when expressing the same semantic content. Reordering poses a serious problem for s...
Alexandra Birch, Miles Osborne, Phil Blunsom