Sciweavers

JCSS
2010
91views more  JCSS 2010»
13 years 10 months ago
Content-dependent chunking for differential compression, the local maximum approach
When a file is to be transmitted from a sender to a recipient and when the latter already has a file somewhat similar to it, remote differential compression seeks to determine t...
Nikolaj Bjørner, Andreas Blass, Yuri Gurevi...
JCSS
2010
49views more  JCSS 2010»
13 years 10 months ago
Prism: An effective approach for frequent sequence mining via prime-block encoding
Karam Gouda, Mosab Hassaan, Mohammed J. Zaki
JCSS
2010
114views more  JCSS 2010»
13 years 10 months ago
FPT algorithms and kernels for the Directed k-Leaf problem
A subgraph T of a digraph D is an out-branching if T is an oriented spanning tree with only one vertex of in-degree zero (called the root). The vertices of T of out-degree zero ar...
Jean Daligault, Gregory Gutin, Eun Jung Kim, Ander...
JCSS
2010
111views more  JCSS 2010»
13 years 10 months ago
Reduction rules for reset/inhibitor nets
Abstract. Reset/inhibitor nets are Petri nets extended with reset arcs and inhibitor arcs. A reset arc allows a transition to remove all tokens from a certain place when the transi...
H. M. W. Verbeek, Moe Thandar Wynn, Wil M. P. van ...
JCSS
2010
105views more  JCSS 2010»
13 years 10 months ago
Fast convolution and Fast Fourier Transform under interval and fuzzy uncertainty
Convolution y(t) = a(t − s) · x(s) ds is one of the main techniques in digital signal processing. A straightforward computation of the convolution y(t) requires O(n2) steps, wh...
Guoqing Liu, Vladik Kreinovich
JCSS
2010
190views more  JCSS 2010»
13 years 10 months ago
Pattern matching with don't cares and few errors
We present solutions for the k-mismatch pattern matching problem with don’t cares. Given a text t of length n and a pattern p of length m with don’t care symbols and a bound k...
Raphaël Clifford, Klim Efremenko, Ely Porat, ...