Sciweavers

IPL
2008
95views more  IPL 2008»
13 years 9 months ago
Efficient algorithms for finding interleaving relationship between sequences
The longest common subsequence and sequence alignment problems have been studied extensively and they can be regarded as the relationship measurement between sequences. However, m...
Kuo-Si Huang, Chang-Biau Yang, Kuo-Tsung Tseng, Hs...
IPL
2008
60views more  IPL 2008»
13 years 9 months ago
A note on the Markoff condition and central words
We define Markoff words as certain factors appearing in bi-infinite words satisfying the Markoff condition. We prove that these words coincide with central words, yielding a new c...
Amy Glen, Aaron Lauve, Franco V. Saliola
IPL
2008
104views more  IPL 2008»
13 years 9 months ago
A note on harmonic subgraphs in labelled geometric graphs
Let S be a set of n points in general position in the plane, labelled bijectively with the integers {0, 1, . . ., n - 1}. Each edge (the straight segment that joins two points) is...
Gabriela Araujo, József Balogh, Ruy Fabila ...
IPL
2008
98views more  IPL 2008»
13 years 9 months ago
Bit-parallel string matching under Hamming distance in O(n[m/w]) worst case time
Given two strings, a pattern P of length m and a text T of length n over some alphabet , we consider the string matching problem under k mismatches. The well
Szymon Grabowski, Kimmo Fredriksson
IPL
2008
146views more  IPL 2008»
13 years 9 months ago
A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs
In this paper, we prove polynomial running time bounds for an Ant Colony Optimization (ACO) algorithm for the single-destination shortest path problem on directed acyclic graphs. ...
Nattapat Attiratanasunthron, Jittat Fakcharoenphol
IPL
2008
72views more  IPL 2008»
13 years 9 months ago
On the parameterized complexity of d-dimensional point set pattern matching
Sergio Cabello, Panos Giannopoulos, Christian Knau...
IPL
2008
111views more  IPL 2008»
13 years 9 months ago
Adding cardinality constraints to integer programs with applications to maximum satisfiability
Max-SAT-CC is the following optimization problem: Given a formula in CNF and a bound k, find an assignment with at most k variables being set to true that maximizes the number of ...
Markus Bläser, Thomas Heynen, Bodo Manthey
IPL
2008
95views more  IPL 2008»
13 years 9 months ago
Optimal point removal in closed-2PM labeling
An optimal labeling where labels are disjoint axis-parallel equal-size squares is called 2PM labeling if the labels have maximum length each attached to its corresponding point on...
Farshad Rostamabadi, Iman Sadeghi, Mohammad Ghodsi...
IPL
2008
41views more  IPL 2008»
13 years 9 months ago
On the interconnection of message passing systems
Angel Alvarez, Sergio Arévalo, Vicent Cholv...