2489 search results - page 57 / 498 » On the Subgroup Distance Problem |
112
Voted
APPML
2008
15 years 3 months ago
2008
We provide a complete answer to the problem which consists in finding an unpointed convex cone lying at minimal bounded Pompeiu-Hausdorff distance from a pointed one. We give also...
127
Voted
FLAIRS
2008
15 years 6 months ago
2008
Anomaly detection methods can be very useful in identifying unusual or interesting patterns in data. A recently proposed conditional anomaly detection framework extends anomaly de...
132
Voted
COMPGEOM
2003
ACM
15 years 9 months ago
2003
ACM
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
120
Voted
ECIR
2010
Springer
15 years 5 months ago
2010
Springer
A promising way to accelerate similarity search is semantic hashing which designs compact binary codes for a large number of documents so that semantically similar documents are ma...
141
Voted
BIOINFORMATICS
2011
14 years 10 months ago
2011
Motivation: The double cut and join operation (abbreviated as DCJ) has been extensively used for genomic rearrangement. Although the DCJ distance between signed genomes with both ...