Sciweavers

202 search results - page 20 / 41
» Counting Distance Permutations
Sort
View
IJCGA
2010
96views more  IJCGA 2010»
13 years 6 months ago
Frameworks Symmetry and Rigidity
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...
John C. Owen, Steve C. Power
ACMSE
1992
ACM
14 years 1 months ago
Disk performance enhancement through Markov-based cylinder remapping
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...
Robert Geist, Darrell Suggs, Robert G. Reynolds, S...
JDA
2007
83views more  JDA 2007»
13 years 8 months ago
Optimal leaf ordering of complete binary trees
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...
Ulrik Brandes
WWW
2010
ACM
14 years 4 months ago
Visualizing differences in web search algorithms using the expected weighted hoeffding distance
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...
Mingxuan Sun, Guy Lebanon, Kevyn Collins-Thompson
CORR
2008
Springer
72views Education» more  CORR 2008»
13 years 9 months ago
Longest paths in Planar DAGs in Unambiguous Logspace
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...
Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar