Sciweavers

540 search results - page 79 / 108
» A New Compression Method for Compressed Matching
Sort
View
SDM
2010
SIAM
181views Data Mining» more  SDM 2010»
14 years 11 months ago
Making k-means Even Faster
The k-means algorithm is widely used for clustering, compressing, and summarizing vector data. In this paper, we propose a new acceleration for exact k-means that gives the same a...
Greg Hamerly
PRL
1998
85views more  PRL 1998»
14 years 9 months ago
Large encrypting binary images with higher security
In this paper, we present a new approach for encrypting binary images. Putting different scan patterns at the same level in Ž .the scan tree structure and employing a two-dimensi...
Kuo-Liang Chung, Lung-Chun Chang
IGARSS
2009
14 years 7 months ago
A Novel STAP Algorithm using Sparse Recovery Technique
A novel STAP algorithm based on sparse recovery technique, called CS-STAP, were presented. Instead of using conventional maximum likelihood estimation of covariance matrix, our met...
Ke Sun, Hao Zhang, Gang Li, Huadong Meng, Xiqin Wa...
CVPR
2005
IEEE
15 years 11 months ago
Contrast Enhancement of Multi-Displays Using Human Contrast Sensitivity
Study of contrast sensitivity of the human eye shows that we are more sensitive to brightness differences at low intensity levels than at high intensity levels. We apply this fact...
Aditi Majumder
ICPR
2008
IEEE
15 years 11 months ago
Texture segmentation benchmark
The Prague texture segmentation data-generator and benchmark is a web based (http://mosaic.utia.cas.cz) service designed to mutually compare and rank different texture segmenters,...
Michal Haindl, Stanislav Mikes