Sciweavers

152 search results - page 12 / 31
» Sorting by reversals is difficult
Sort
View
SIAMDM
2010
105views more  SIAMDM 2010»
13 years 2 months ago
A Lower Bound on the Transposition Diameter
Sorting permutations by transpositions is an important and difficult problem in genome rearrangements. The transposition diameter TD(n) is the maximum transposition distance among ...
Linyuan Lu, Yiting Yang
ICDAR
2003
IEEE
14 years 23 days ago
Directional Wavelet Approach to Remove Document Image Interference
In this paper, we propose a directional wavelet approach to remove images of interfering strokes coming from the back of a historical handwritten document due to seeping of ink du...
Qian Wang, Tao Xia, Chew Lim Tan, Lida Li
CORR
2008
Springer
85views Education» more  CORR 2008»
13 years 7 months ago
Ranking and Unranking of Hereditarily Finite Functions and Permutations
Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. ranki...
Paul Tarau
DAGSTUHL
2006
13 years 9 months ago
Vertex reconstruction in Cayley graphs
In this report paper we collect recent results on the vertex reconstruction in Cayley graphs Cay(G, S). The problem is stated as the problem of reconstructing a vertex from the mi...
Elena V. Konstantinova
TEC
2002
161views more  TEC 2002»
13 years 7 months ago
A fast and elitist multiobjective genetic algorithm: NSGA-II
Multiobjective evolutionary algorithms (EAs) that use nondominated sorting and sharing have been criticized mainly for their: 1) ( 3) computational complexity (where is the number ...
Kalyanmoy Deb, Samir Agrawal, Amrit Pratap, T. Mey...