Sciweavers

215 search results - page 27 / 43
» Sums of squares based approximation algorithms for MAX-SAT
Sort
View
ICPR
2002
IEEE
14 years 9 months ago
Fast Hierarchical Clustering Based on Compressed Data
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
Erendira Rendon, Ricardo Barandela
PKDD
2000
Springer
144views Data Mining» more  PKDD 2000»
14 years 5 days ago
Fast Hierarchical Clustering Based on Compressed Data and OPTICS
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
Markus M. Breunig, Hans-Peter Kriegel, Jörg S...
KDD
2007
ACM
148views Data Mining» more  KDD 2007»
14 years 9 months ago
Scalable look-ahead linear regression trees
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
David S. Vogel, Ognian Asparouhov, Tobias Scheffer
CVPR
2008
IEEE
14 years 10 months ago
Robust tensor factorization using R1 norm
Over the years, many tensor based algorithms, e.g. two dimensional principle component analysis (2DPCA), two dimensional singular value decomposition (2DSVD), high order SVD, have...
Heng Huang, Chris H. Q. Ding
ICASSP
2008
IEEE
14 years 3 months ago
Low-rank covariance matrix tapering for robust adaptive beamforming
Covariance matrix tapering (CMT) is a popular approach to improve the robustness of adaptive beamformers against moving or wideband interferers. In this paper, we develop a comput...
Michael Rübsamen, Christian Gerlach, Alex B. ...