Chun Jiang Zhu,Kam-Yiu Lam,Joseph Kee Yin Ng et al. Chun Jiang Zhu et al.

The VC-dimension, which has wide uses in learning theory, has been used in the analysis and design of graph algorithms recently. In this paper, we study the problem of bounding the VC-dimension of unique round-trip shortest path set systems...

Andrea Visconti,Chiara Valentina Schiavo,René Peralta Andrea Visconti

Minimizing the Boolean circuit implementation of a given cryptographic function is an important issue. A number of papers [1], [2], [3], [4] only consider cancellation-free straight-line programs for producing small circuits over GF(2). Can...

Marius Nicolae,Sanguthevar Rajasekaran Marius Nicolae

We consider the problem of pattern matching with k mismatches, where there can be don't care or wild card characters in the pattern. Specifically, given a pattern P of length m and a text T of length n, we want to find all occurrences of P ...

Therese Biedl,Martin Held,Stefan Huber et al. Therese Biedl et al.

We study the characteristics of straight skeletons of monotone polygonal chains and use them to devise an algorithm for computing positively weighted straight skeletons of monotone polygons. Our algorithm runs in [Formula: see text] time an...

Xiaodong Wu Xiaodong Wu

In this paper, we study several interesting intensity map splitting (IMSp) problems that arise in Intensity-Modulated Radiation Therapy (IMRT), a state-of-the-art radiation therapy technique for cancer treatments. In current clinical practi...