2489 search results - page 139 / 498 » On the Subgroup Distance Problem |
155
click to vote
VLDB
2002
ACM
15 years 3 months ago
2002
ACM
The problem of indexing time series has attracted much interest. Most algorithms used to index time series utilize the Euclidean distance or some variation thereof. However, it has...
145
click to vote
RSA
2008
15 years 3 months ago
2008
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
139
click to vote
ALGORITHMICA
2008
15 years 4 months ago
2008
In this paper we present techniques to significantly improve the space complexity of several ordered tree comparison algorithms without sacrificing the corresponding time complexit...
134
click to vote
CLASSIFICATION
2008
15 years 4 months ago
2008
: We present a new iterative method for probabilistic clustering of data. Given clusters, their centers and the distances of data points from these centers, the probability of clus...
111
Voted
IEICET
2006
15 years 4 months ago
2006
A network based on the Inverse Function Delayed (ID) model, which can recall a temporal sequence of patterns, is proposed. The classical problem, that the network is forced to make...