Sciweavers

115 search results - page 12 / 23
» Fast approximate spectral clustering
Sort
View
ICMCS
2005
IEEE
132views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Approximating the selectivity of multimedia range queries
This paper introduces a new approach of approximating the selectivity of multimedia range queries. Estimating the selectivity of a range query is a pre-requisite to optimize a mul...
Mario Döller, Harald Kosch
ICDE
2007
IEEE
117views Database» more  ICDE 2007»
14 years 9 months ago
Clustering wavelets to speed-up data dissemination in structured P2P MANETs
This paper introduces a fast data dissemination method for structured peer-to-peer networks. The work is motivated on one side by the increase in non-volatile memory available on ...
Mihai Lupu, Jianzhong Li, Beng Chin Ooi, Shengfei ...
KDD
1997
ACM
159views Data Mining» more  KDD 1997»
13 years 11 months ago
New Algorithms for Fast Discovery of Association Rules
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mi...
ISCA
2007
IEEE
217views Hardware» more  ISCA 2007»
13 years 7 months ago
Parallel Processing of High-Dimensional Remote Sensing Images Using Cluster Computer Architectures
Hyperspectral sensors represent the most advanced instruments currently available for remote sensing of the Earth. The high spatial and spectral resolution of the images supplied ...
David Valencia, Antonio Plaza, Pablo Martín...
DCC
2009
IEEE
14 years 8 months ago
Clustered Reversible-KLT for Progressive Lossy-to-Lossless 3d Image Coding
The RKLT is a lossless approximation to the KLT, and has been recently employed for progressive lossy-to-lossless coding of hyperspectral images. Both yield very good coding perfo...
Ian Blanes, Joan Serra-Sagristà