Sciweavers

65 search results - page 3 / 13
» Local Enumeration Techniques for Sparse Algorithms
Sort
View
CIKM
2010
Springer
13 years 4 months ago
Novel local features with hybrid sampling technique for image retrieval
In image retrieval, most existing approaches that incorporate local features produce high dimensional vectors, which lead to a high computational and data storage cost. Moreover, ...
Leszek Kaliciak, Dawei Song, Nirmalie Wiratunga, J...
ICONIP
2007
13 years 7 months ago
Flexible Component Analysis for Sparse, Smooth, Nonnegative Coding or Representation
In the paper, we present a new approach to multi-way Blind Source Separation (BSS) and corresponding 3D tensor factorization that has many potential applications in neuroscience an...
Andrzej Cichocki, Anh Huy Phan, Rafal Zdunek, Liqi...
JCP
2008
133views more  JCP 2008»
13 years 5 months ago
DDSC : A Density Differentiated Spatial Clustering Technique
Finding clusters with widely differing sizes, shapes and densities in presence of noise and outliers is a challenging job. The DBSCAN is a versatile clustering algorithm that can f...
Bhogeswar Borah, Dhruba K. Bhattacharyya
DAC
2011
ACM
12 years 5 months ago
Efficient incremental analysis of on-chip power grid via sparse approximation
In this paper, a new sparse approximation technique is proposed for incremental power grid analysis. Our proposed method is motivated by the observation that when a power grid net...
Pei Sun, Xin Li, Ming Yuan Ting
ISPA
2004
Springer
13 years 11 months ago
Parallel Volume Rendering with Early Ray Termination for Visualizing Large-Scale Datasets
Abstract. This paper presents an efficient parallel algorithm for volume rendering of large-scale datasets. Our algorithm focuses on an optimization technique, namely early ray te...
Manabu Matsui, Fumihiko Ino, Kenichi Hagihara