IDA
2001
Springer
15 years 1 months ago
2001
Springer
This paper describes an unsupervised algorithm for segmenting categorical time series. The algorithm first collects statistics about the frequency and boundary entropy of ngrams, t...
ICDT
2001
ACM
15 years 1 months ago
2001
ACM
Abstract. Many data mining approaches focus on the discovery of similar (and frequent) data values in large data sets. We present an alternative, but complementary approach in whic...
100
click to vote
FSTTCS
2001
Springer
15 years 1 months ago
2001
Springer
Consider a directed graph G = (V, E) with n vertices and a root vertex r ∈ V . The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is...
EMMCVPR
2001
Springer
15 years 1 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
CPM
2001
Springer
15 years 1 months ago
2001
Springer
Abstract. Compressed pattern matching is one of the most active topics in string matching. The goal is to find all occurrences of a pattern in a compressed text without decompress...
CAIP
2001
Springer
15 years 1 months ago
2001
Springer
This paper is a continuation to the work in [1], in which a new algorithm for skeletonization is introduced. The algorithm given there and implemented for script and text is applie...
WIA
2009
Springer
15 years 1 months ago
2009
Springer
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft’s algorithm. Hopcroft’s algorithm has several degrees o...
PSIVT
2009
Springer
15 years 1 months ago
2009
Springer
This article provides a simple and general way for defining the recovery rate of clustering algorithms using a given family of old clusters for evaluating the performance of the a...
IWCIA
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. The paper studies local convexity properties of parts of digital boundaries. An online and linear-time algorithm is introduced for the decomposition of a digital boundary...
IVA
2009
Springer
15 years 1 months ago
2009
Springer
This paper presents a quest for the most suitable setting and method to assess the naturalness of the output of an existing algorithm for the generation of multimodal referring exp...