Sciweavers

2131 search results - page 119 / 427
» Co-Scheduling of Computation and Data on Computer Clusters
Sort
View
ICCV
2003
IEEE
16 years 6 months ago
Mean Shift Based Clustering in High Dimensions: A Texture Classification Example
Feature space analysis is the main module in many computer vision tasks. The most popular technique, k-means clustering, however, has two inherent limitations: the clusters are co...
Bogdan Georgescu, Ilan Shimshoni, Peter Meer
ICDM
2006
IEEE
130views Data Mining» more  ICDM 2006»
15 years 10 months ago
Efficient Clustering for Orders
Lists of ordered objects are widely used as representational forms. Such ordered objects include Web search results or best-seller lists. Clustering is a useful data analysis tech...
Toshihiro Kamishima, Shotaro Akaho
TDSC
2011
14 years 11 months ago
CASTLE: Continuously Anonymizing Data Streams
— Most of existing privacy preserving techniques, such as k-anonymity methods, are designed for static data sets. As such, they cannot be applied to streaming data which are cont...
Jianneng Cao, Barbara Carminati, Elena Ferrari, Ki...
SAC
2004
ACM
15 years 9 months ago
Unsupervised learning techniques for an intrusion detection system
With the continuous evolution of the types of attacks against computer networks, traditional intrusion detection systems, based on pattern matching and static signatures, are incr...
Stefano Zanero, Sergio M. Savaresi
CVPR
2007
IEEE
16 years 6 months ago
Adaptive Distance Metric Learning for Clustering
A good distance metric is crucial for unsupervised learning from high-dimensional data. To learn a metric without any constraint or class label information, most unsupervised metr...
Jieping Ye, Zheng Zhao, Huan Liu