2489 search results - page 387 / 498 » On the Subgroup Distance Problem |
137
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...
205
click to vote
VLDB
2007
ACM
16 years 3 months ago
2007
ACM
Record matching is the task of identifying records that match the same real world entity. This is a problem of great significance for a variety of business intelligence applicatio...
215
click to vote
VLDB
2007
ACM
16 years 3 months ago
2007
ACM
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...
215
click to vote
SIGMOD
2006
ACM
16 years 3 months ago
2006
ACM
To enable efficient similarity search in large databases, many indexing techniques use a linear transformation scheme to reduce dimensions and allow fast approximation. In this re...
147
click to vote
SIGMOD
2003
ACM
16 years 3 months ago
2003
ACM
Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly dete...