2489 search results - page 58 / 498 » On the Subgroup Distance Problem |
110
click to vote
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
Given a set P of n points in convex position in the plane, we prove that there exists a point p ∈ P such that the number of distinct distances from p is at least (13n−6)/36 . ...
109
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Similarity search is an important problem in information retrieval. This similarity is based on a distance. Symbolic representation of time series has attracted many researchers re...
145
Voted
PVLDB
2010
14 years 10 months ago
2010
Probabilistic data is coming as a new deluge along with the technical advances on geographical tracking, multimedia processing, sensor network and RFID. While similarity search is...
136
Voted
WSDM
2010
ACM
16 years 1 months ago
2010
ACM
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
130
Voted
MFCS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Given a distance matrix M that specifies the pairwise evolutionary distances between n species, the phylogenetic tree reconstruction problem asks for an edge-weighted ph...