340 search results - page 18 / 68 » Clustering with Lower Bound on Similarity |
CORR
2007
Springer
14 years 9 months ago
2007
Springer
—In the analysis of large random wireless networks, the underlying node distribution is almost ubiquitously assumed to be the homogeneous Poisson point process. In this paper, th...
CORR
2012
Springer
13 years 5 months ago
2012
Springer
We show that the log-likelihood of several probabilistic graphical models is Lipschitz continuous with respect to the p-norm of the parameters. We discuss several implications ...
DAGSTUHL
2006
14 years 11 months ago
2006
Abstract. Similarity search in large multimedia databases requires efficient query processing based on suitable similarity models. Similarity models consist of a feature extraction...
CIKM
2006
Springer
15 years 1 months ago
2006
Springer
In this paper we introduce the distributed spatio-temporal similarity search problem: given a query trajectory Q, we want to find the trajectories that follow a motion similar to ...
163
click to vote
GIS
2007
ACM
15 years 10 months ago
2007
ACM
The increasingly popular GPS technology and the growing amount of trajectory data it generates create the need for developing applications that efficiently store and query traject...