ACL
2012
11 years 7 months ago
2012
We propose a novel heuristic algorithm for Cube Pruning running in linear time in the beam size. Empirically, we show a gain in running time of a standard machine translation syst...
WABI
2010
Springer
13 years 2 months ago
2010
Springer
The double cut and join (DCJ) operation, introduced by Yancopoulos, Attie and Friedberg in 2005, allows one to represent most rearrangement events in genomes. However, a DCJ cannot...
SIAMCOMP
2008
13 years 4 months ago
2008
Helly's theorem says that, if every d+1 elements of a given finite set of convex objects in Rd have a common point, there is a point common to all of the objects in the set. I...
JDA
2006
13 years 4 months ago
2006
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...
DM
2007
13 years 4 months ago
2007
In this paper it is shown that a class of almost-median graphs that includes all planar almost-median graphs can be recognized in O(m log n) time, where n denotes the number of ve...
DAM
2007
13 years 4 months ago
2007
Primitive words, or strings over a finite alphabet that cannot be written as a power of another string, play an important role in numerous research areas including formal language...
JLP
2008
13 years 4 months ago
2008
Currently known sequent systems for temporal logics such as linear time temporal logic and computation tree logic either rely on a cut rule, an invariant rule, or an infinitary ru...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
We prove that the single-player game clobber is solvable in linear time when played on a line or on a cycle. For this purpose, we show that this game is equivalent to an optimizat...
ENTCS
2006
13 years 4 months ago
2006
In the past, partial order reduction has been used successfully to combat the state explosion problem in the context of model checking for non-probabilistic systems. For both line...
CG
2006
Springer
13 years 4 months ago
2006
Springer
Blurred segments were introduced by Debled-Rennesson et al. [Segmentation of discrete curves into fuzzy segments. In: 9th IWCIA, Electronic notes in discrete mathematics, vol. 12;...