7006 search results - page 291 / 1402 » Approximation Algorithms |
112
Voted
ICPR
2002
IEEE
16 years 4 months ago
2002
IEEE
A method for measuring dissimilarities between cyclic strings is introduced. It computes a weighted mean between two (lower and upper) bounds of the exact cyclic edit distance, wh...
119
click to vote
WADS
2007
Springer
15 years 10 months ago
2007
Springer
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first layer of the ...
157
click to vote
CBMS
2005
IEEE
15 years 9 months ago
2005
IEEE
In this work we introduce the new problem of finding time series discords. Time series discords are subsequences of longer time series that are maximally different to all the rest...
109
click to vote
MICAI
2004
Springer
15 years 9 months ago
2004
Springer
In this paper we make use of a modified Grid Based Fuzzy System architecture, which may provide an exponential reduction in the number of rules needed. We also introduce an algori...
139
click to vote
ACCV
2009
Springer
15 years 7 months ago
2009
Springer
Recent local state-of-the-art stereo algorithms based on variable cost aggregation strategies allow for inferring disparity maps comparable to those yielded by algorithms based on ...