Sciweavers

1227 search results - page 131 / 246
» Approximate Kernel Clustering
Sort
View
BMCBI
2006
141views more  BMCBI 2006»
14 years 10 months ago
Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
Sylvain Forêt, Miriam R. Kantorovitz, Conrad...
DCC
2009
IEEE
15 years 10 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à
SMI
2008
IEEE
108views Image Analysis» more  SMI 2008»
15 years 4 months ago
Variational Multilevel Mesh Clustering
In this paper a novel clustering algorithm is proposed, namely Variational Multilevel Mesh Clustering (VMLC). The algorithm incorporates the advantages of both hierarchical and va...
Iurie Chiosa, Andreas Kolb
ICC
2007
IEEE
203views Communications» more  ICC 2007»
15 years 4 months ago
Distributed Data Aggregation Using Clustered Slepian-Wolf Coding in Wireless Sensor Networks
—Slepian-Wolf coding is a promising distributed source coding technique that can completely remove the data redundancy caused by the spatially correlated observations in wireless...
Pu Wang, Cheng Li, Jun Zheng
SSD
2005
Springer
173views Database» more  SSD 2005»
15 years 3 months ago
On Discovering Moving Clusters in Spatio-temporal Data
A moving cluster is defined by a set of objects that move close to each other for a long time interval. Real-life examples are a group of migrating animals, a convoy of cars movin...
Panos Kalnis, Nikos Mamoulis, Spiridon Bakiras