202 search results - page 20 / 41 » Counting Distance Permutations |
82
Voted
IJCGA
2010
14 years 10 months ago
2010
Symmetry equations are obtained for the rigidity matrix of a bar-joint framework in Rd . These form the basis for a short proof of the FowlerGuest symmetry group generalisation of...
115
Voted
ACMSE
1992
ACM
15 years 4 months ago
1992
ACM
A scheme for disk subsystem performance enhancement that is based on (virtual) cylinder remapping is proposed. A natural workload on a real system is measured, and statistical tes...
89
Voted
JDA
2007
15 years 21 days ago
2007
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...
122
click to vote
WWW
2010
ACM
15 years 7 months ago
2010
ACM
We introduce a new dissimilarity function for ranked lists, the expected weighted Hoeffding distance, that has several advantages over current dissimilarity measures for ranked s...
103
Voted
CORR
2008
Springer
15 years 27 days ago
2008
Springer
Reachability and distance computation are known to be NL-complete in general graphs, but within UL co-UL if the graphs are planar. However, finding longest paths is known to be N...