102 search results - page 5 / 21 » Improved Bounds for Geometric Permutations |
100
click to vote
SIAMDM
2010
14 years 10 months ago
2010
K¨orner and Malvenuto asked whether one can find n n/2 linear orderings (i.e., permutations) of the first n natural numbers such that any pair of them places two consecutive int...
ISAAC
2001
Springer
15 years 4 months ago
2001
Springer
We consider the problem of developing algorithms for the recognition of a fixed pattern within a permutation. These methods are based upon using a carefully chosen chain or tree ...
DCC
2008
IEEE
15 years 11 months ago
2008
IEEE
We introduce a new variant of the popular Burrows-Wheeler transform (BWT) called Geometric Burrows-Wheeler Transform (GBWT). Unlike BWT, which merely permutes the text, GBWT conve...
104
click to vote
MST
2002
14 years 11 months ago
2002
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
CVRMED
1997
Springer
1997
Springer
Geometric constraint analysis and synthesis: methods for improving shape-based registration accuracy
15 years 3 months ago
Shape-based registration is a process for estimating the transformation between two shape representations of an object. It is used in many image-guided surgical systems to establis...