Sciweavers

148 search results - page 5 / 30
» HaLoop: Efficient Iterative Data Processing on Large Cluster...
Sort
View
ICIP
2002
IEEE
15 years 2 months ago
An iterative algorithm for context selection in adaptive entropy coders
Context-based adaptive entropy coding is an essential feature of modern image compression algorithms; however, the design of these coders is non-trivial due to the balance that mu...
Tong Jin, Jacques Vaisey
81
Voted
ICPR
2010
IEEE
14 years 7 months ago
User Adaptive Clustering for Large Image Databases
Abstract--Searching large image databases is a time consuming process when done manually. Current CBIR methods mostly rely on training data in specific domains. When source and dom...
Mohammad Mehdi Saboorian, Mansour Jamzad, Hamid R....
CGF
2010
171views more  CGF 2010»
14 years 6 months ago
Efficient Mean-shift Clustering Using Gaussian KD-Tree
Mean shift is a popular approach for data clustering, however, the high computational complexity of the mean shift procedure limits its practical applications in high dimensional ...
Chunxia Xiao, Meng Liu
GCB
2003
Springer
105views Biometrics» more  GCB 2003»
15 years 2 months ago
In silico prediction of UTR repeats using clustered EST data
Clustering of EST data is a method for the non-redundant representation of an organisms transcriptome. During clustering of large amounts of EST data, usually some large clusters ...
Stefan A. Rensing, Daniel Lang, Ralf Reski
ICS
2010
Tsinghua U.
14 years 12 months ago
Clustering performance data efficiently at massive scales
Existing supercomputers have hundreds of thousands of processor cores, and future systems may have hundreds of millions. Developers need detailed performance measurements to tune ...
Todd Gamblin, Bronis R. de Supinski, Martin Schulz...