Sciweavers

2052 search results - page 228 / 411
» Direct Combination
Sort
View
ICDM
2008
IEEE
99views Data Mining» more  ICDM 2008»
16 years 1 months ago
Finding Good Itemsets by Packing Data
The problem of selecting small groups of itemsets that represent the data well has recently gained a lot of attention. We approach the problem by searching for the itemsets that c...
Nikolaj Tatti, Jilles Vreeken
ICDM
2008
IEEE
252views Data Mining» more  ICDM 2008»
16 years 1 months ago
Data Mining for Climate Change and Impacts
Knowledge discovery from temporal, spatial and spatiotemporal data is critical for climate change science and climate impacts. Climate statistics is a mature area. However, recent...
Auroop R. Ganguly, Karsten Steinhaeuser
MMSP
2008
IEEE
119views Multimedia» more  MMSP 2008»
16 years 1 months ago
Network image coding for multicast
—We consider a new problem in network image coding for multicast. In a multihop mesh network, structured as a directed graph, all nodes decode and display reconstructions of the ...
David P. Varodayan, David M. Chen, Bernd Girod
SISAP
2008
IEEE
115views Data Mining» more  SISAP 2008»
16 years 1 months ago
A Dynamic Pivot Selection Technique for Similarity Search
All pivot-based algorithms for similarity search use a set of reference points called pivots. The pivot-based search algorithm precomputes some distances to these reference points...
Benjamin Bustos, Oscar Pedreira, Nieves R. Brisabo...
SMI
2008
IEEE
123views Image Analysis» more  SMI 2008»
16 years 1 months ago
SHREC'08 entry: 3D shape searching using object partitioning
In this paper we propose a novel algorithm for 3D shape searching based on the visual similarity by cutting the object into sections. This method rectifies some of the shortcomin...
Asim Wagan, Afzal Godil, Xiaolan Li