Sciweavers

18 search results - page 3 / 4
» K-means Clustering with Feature Hashing
Sort
View
ICCV
2003
IEEE
14 years 7 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
SC
2004
ACM
13 years 10 months ago
A Self-Organizing Storage Cluster for Parallel Data-Intensive Applications
Cluster-based storage systems are popular for data-intensive applications and it is desirable yet challenging to provide incremental expansion and high availability while achievin...
Hong Tang, Aziz Gulbeden, Jingyu Zhou, William Str...
CCE
2006
13 years 5 months ago
New approaches for representing, analyzing and visualizing complex kinetic transformations
Complex kinetic mechanisms involving thousands of reacting species and tens of thousands of reactions are currently required for the rational analysis of modern combustion systems...
Ioannis P. Androulakis
ICIP
2010
IEEE
13 years 3 months ago
Rotation robust detection of copy-move forgery
Copy-move tampering is a common type of image synthesizing, where a part of an image is copied and pasted to another place to add or remove an object. In this paper, an efficient ...
Weihai Li, Nenghai Yu
SSDBM
2005
IEEE
184views Database» more  SSDBM 2005»
13 years 11 months ago
Optimizing Multiple Top-K Queries over Joins
Advanced Data Mining applications require more and more support from relational database engines. Especially clustering applications in high dimensional features space demand a pr...
Dirk Habich, Wolfgang Lehner, Alexander Hinneburg