Sciweavers

3818 search results - page 186 / 764
» Word Problems on Compressed Words
Sort
View
COCOON
2008
Springer
15 years 8 months ago
Approximating the Generalized Capacitated Tree-Routing Problem
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
Ehab Morsy, Hiroshi Nagamochi
COR
2006
138views more  COR 2006»
15 years 6 months ago
Deconstructing Nowicki and Smutnicki's i-TSAB tabu search algorithm for the job-shop scheduling problem
Over the last decade and a half, tabu search algorithms for machine scheduling have gained a near-mythical reputation by consistently equaling or establishing state-of-the-art per...
Jean-Paul Watson, Adele E. Howe, L. Darrell Whitle...
JC
2007
160views more  JC 2007»
15 years 6 months ago
BDDC methods for discontinuous Galerkin discretization of elliptic problems
A discontinuous Galerkin (DG) discretization of Dirichlet problem for second-order elliptic equations with discontinuous coefficients in 2-D is considered. For this discretization...
Maksymilian Dryja, Juan Galvis, Marcus Sarkis
JGO
2011
122views more  JGO 2011»
15 years 1 months ago
Towards the global solution of the maximal correlation problem
The maximal correlation problem (MCP) aiming at optimizing correlation between sets of variables plays a very important role in many areas of statistical applications. Currently, a...
Lei-Hong Zhang, Li-Zhi Liao, Li-Ming Sun
CVPR
2007
IEEE
16 years 8 months ago
Enhanced Level Building Algorithm for the Movement Epenthesis Problem in Sign Language Recognition
One of the hard problems in automated sign language recognition is the movement epenthesis (me) problem. Movement epenthesis is the gesture movement that bridges two consecutive s...
Ruiduo Yang, Sudeep Sarkar, Barbara L. Loeding