Sciweavers

10493 search results - page 135 / 2099
» Dynamic Word Problems
Sort
View
SPIRE
2004
Springer
14 years 1 months ago
Linear Time Algorithm for the Longest Common Repeat Problem
Given a set of strings U = {T1, T2, . . . , T }, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of U. We als...
Inbok Lee, Costas S. Iliopoulos, Kunsoo Park
DM
2008
58views more  DM 2008»
13 years 8 months ago
The vertex isoperimetric problem for the powers of the diamond graph
We introduce a new graph for all whose cartesian powers the vertex isoperimetric problem has nested solutions. This is the fourth kind of graphs with this property besides the wel...
Sergei L. Bezrukov, Miquel Rius, Oriol Serra
JCSS
2010
155views more  JCSS 2010»
13 years 6 months ago
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
We develop an algorithmically useful refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This characterization ...
Michael Dom, Jiong Guo, Rolf Niedermeier
CMA
2010
155views more  CMA 2010»
13 years 5 months ago
Approximate solutions to a parameterized sixth order boundary value problem
In this paper, the homotopy analysis method (HAM) is applied to solve a parameterized sixth order boundary value problem which, for large parameter values, cannot be solved by oth...
Songxin Liang, David J. Jeffrey
JCAM
2010
173views more  JCAM 2010»
13 years 2 months ago
A filter diagonalization for generalized eigenvalue problems based on the Sakurai-Sugiura projection method
The Sakurai-Sugiura projection method, which solves a generalized eigenvalue problem to find certain eigenvalues in a given domain, was reformulated by using the resolvent theory....
Tsutomu Ikegami, Tetsuya Sakurai, Umpei Nagashima