Sciweavers

Share
ACL
2012
7 years 4 months ago
Heuristic Cube Pruning in Linear Time
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...
Andrea Gesmundo, Giorgio Satta, James Henderson
WABI
2010
Springer
160views Bioinformatics» more  WABI 2010»
9 years 21 days ago
Genomic Distance with DCJ and Indels
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...
Marília D. V. Braga, Eyla Willing, Jens Sto...
SIAMCOMP
2008
95views more  SIAMCOMP 2008»
9 years 2 months ago
On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-Type Model
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...
Nir Halman
JDA
2006
85views more  JDA 2006»
9 years 2 months ago
Average case analysis of DJ graphs
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...
Johann Blieberger
DM
2007
98views more  DM 2007»
9 years 2 months ago
Fast recognition of classes of almost-median graphs
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...
Wilfried Imrich, Alenka Lipovec, Iztok Peterin, Pe...
DAM
2007
85views more  DAM 2007»
9 years 2 months ago
Testing primitivity on partial words
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...
Francine Blanchet-Sadri, Arundhati R. Anavekar
JLP
2008
81views more  JLP 2008»
9 years 2 months ago
Cut-free sequent systems for temporal logic
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...
Kai Brünnler, Martin Lange
CORR
2007
Springer
148views Education» more  CORR 2007»
9 years 2 months ago
Linear time algorithms for Clobber
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...
Vincent D. Blondel, Julien M. Hendrickx, Raphael M...
ENTCS
2006
134views more  ENTCS 2006»
9 years 2 months ago
Partial Order Reduction for Probabilistic Branching Time
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...
Christel Baier, Pedro R. D'Argenio, Marcus Grö...
CG
2006
Springer
9 years 2 months ago
Optimal blurred segments decomposition of noisy shapes in linear time
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;...
Isabelle Debled-Rennesson, Fabien Feschet, Jocelyn...
books