1085 search results - page 61 / 217 » Hug over a distance |
WADS
2005
Springer
14 years 3 months ago
2005
Springer
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
ICDAR
2003
IEEE
14 years 3 months ago
2003
IEEE
Classifying an unknown input is a fundamental problem in pattern recognition. A common method is to define a distance metric between patterns and find the most similar pattern i...
SIGMOD
1998
ACM
14 years 2 months ago
1998
ACM
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along with the complexity of the objects such as images...
CIARP
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. A major characteristic of text document categorization problems is the extremely high dimensionality of text data. In this paper we explore the usability of the Oscillati...
VLDB
2000
ACM
14 years 1 months ago
2000
ACM
Fast indexing in time sequence databases for similarity searching has attracted a lot of research recently. Most of the proposals, however, typically centered around the Euclidean...