Sciweavers

340 search results - page 14 / 68
» Clustering with Lower Bound on Similarity
Sort
View
DM
2007
136views more  DM 2007»
14 years 9 months ago
Lower connectivities of regular graphs with small diameter
Krishnamoorthy, Thulasiraman and Swamy [Minimum order graphs with specified diameter, connectivity and regularity, Networks 19 (1989) 25–46] showed that a δ-regular graph with...
Camino Balbuena, Xavier Marcote
DMIN
2006
115views Data Mining» more  DMIN 2006»
14 years 10 months ago
Indexing Spatio-Temporal Trajectories with Orthogonal Polynomials
Abstract-- In this paper we consider d-dimensional spatiotemporal data (d 1) and ways to approximate and index it. We focus on indexing such data for similarity matching using orth...
Elena Braynova
TKDE
2011
332views more  TKDE 2011»
14 years 4 months ago
Adaptive Cluster Distance Bounding for High-Dimensional Indexing
—We consider approaches for similarity search in correlated, high-dimensional data-sets, which are derived within a clustering framework. We note that indexing by “vector appro...
Sharadh Ramaswamy, Kenneth Rose
PAKDD
2010
ACM
169views Data Mining» more  PAKDD 2010»
14 years 11 months ago
Correspondence Clustering: An Approach to Cluster Multiple Related Spatial Datasets
Domain experts are frequently interested to analyze multiple related spatial datasets. This capability is important for change analysis and contrast mining. In this paper, a novel ...
Vadeerat Rinsurongkawong, Christoph F. Eick
TIT
2002
78views more  TIT 2002»
14 years 9 months ago
Optimal placement of training for frequency-selective block-fading channels
The problem of placing training symbols optimally for orthogonal frequency-division multiplexing (OFDM) and single-carrier systems is considered. The channel is assumed to be quasi...
Srihari Adireddy, Lang Tong, Harish Viswanathan