Sciweavers

10493 search results - page 47 / 2099
» Dynamic Word Problems
Sort
View
ACL
2011
12 years 11 months ago
Word Alignment via Submodular Maximization over Matroids
We cast the word alignment problem as maximizing a submodular function under matroid constraints. Our framework is able to express complex interactions between alignment component...
Hui Lin, Jeff Bilmes
IJAC
2010
122views more  IJAC 2010»
13 years 6 months ago
Automorphic orbits in Free Groups: Words versus Subgroups
We show that the following problems are decidable in rank 2 free groups: does a given finitely generated subgroup H contain primitive elements? and does H meet the automorphic or...
Pedro V. Silva, Pascal Weil
RSA
2010
81views more  RSA 2010»
13 years 6 months ago
Percolation of arbitrary words in one dimension
We consider a type of long-range percolation problem on the positive integers, motivated by earlier work of others on the appearance of (in)finite words within a site percolation...
Geoffrey R. Grimmett, Thomas M. Liggett, Thomas Ri...
ICALP
2005
Springer
14 years 1 months ago
Randomized Fast Design of Short DNA Words
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
EVOW
2009
Springer
13 years 5 months ago
An Immune System Based Genetic Algorithm Using Permutation-Based Dualism for Dynamic Traveling Salesman Problems
In recent years, optimization in dynamic environments has attracted a growing interest from the genetic algorithm community due to the importance and practicability in real world a...
Lili Liu, Dingwei Wang, Shengxiang Yang