Sciweavers

102 search results - page 3 / 21
» Improved Bounds for Geometric Permutations
Sort
View
AAAI
2006
13 years 7 months ago
Dual Search in Permutation State Spaces
Geometrical symmetries are commonly exploited to improve the efficiency of search algorithms. We introduce a new logical symmetry in permutation state spaces which we call duality...
Uzi Zahavi, Ariel Felner, Robert Holte, Jonathan S...
JCSS
2008
80views more  JCSS 2008»
13 years 5 months ago
Improved bounds on sorting by length-weighted reversals
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...
Michael A. Bender, Dongdong Ge, Simai He, Haodong ...
COMBINATORICS
2004
61views more  COMBINATORICS 2004»
13 years 5 months ago
Improved Bounds on the Length of Maximal Abelian Square-free Words
A word is abelian square-free if it does not contain two adjacent subwords which are permutations of each other. Over an alphabet k on k letters, an abelian squarefree word is max...
Evan M. Bullock
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
13 years 11 months ago
Multi-directional Width-Bounded Geometric Separator and Protein Folding
We introduce the concept of multi-directional width-bounded geometric separator and get improved separator for the grid graph, which improves exact algorithm for the protein foldin...
Bin Fu, Sorinel Adrian Oprisan, Lizhe Xu
3DIM
2005
IEEE
13 years 7 months ago
Further Improving Geometric Fitting
We give a formal definition of geometric fitting in a way that suits computer vision applications. We point out that the performance of geometric fitting should be evaluated in...
Ken-ichi Kanatani