2489 search results - page 169 / 498 » On the Subgroup Distance Problem |
167
click to vote
SIGIR
1999
ACM
15 years 8 months ago
1999
ACM
There has been much recent interest in retrieval of time series data. Earlier work has used a fixed similarity metric (e.g., Euclidean distance) to determine the similarity betwee...
125
click to vote
COLT
1999
Springer
15 years 8 months ago
1999
Springer
We study the problem of PAC-learning Boolean functions with random attribute noise under the uniform distribution. We define a noisy distance measure for function classes and sho...
154
click to vote
CIARP
2006
Springer
15 years 8 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...
120
click to vote
VLDB
2000
ACM
15 years 8 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...
126
click to vote
COMPGEOM
1987
ACM
15 years 7 months ago
1987
ACM
We are interested in Voronoi diagrams as a tool in robot path planning, where the search for a path in an r-dimensional space may be simplified to a search on an (r- l)-dimensional...