Sciweavers

115 search results - page 16 / 23
» Fast approximate spectral clustering
Sort
View
JPDC
2006
185views more  JPDC 2006»
13 years 7 months ago
Commodity cluster-based parallel processing of hyperspectral imagery
The rapid development of space and computer technologies has made possible to store a large amount of remotely sensed image data, collected from heterogeneous sources. In particul...
Antonio Plaza, David Valencia, Javier Plaza, Pablo...
ICCD
2000
IEEE
87views Hardware» more  ICCD 2000»
13 years 12 months ago
Binary and Multi-Valued SPFD-Based Wire Removal in PLA Networks
This paper describes the application of binary and multivalued SPFD-based wire removal techniques for circuit implementations utilizing networks of PLAs. It has been shown that a ...
Subarnarekha Sinha, Sunil P. Khatri, Robert K. Bra...
SBBD
2000
168views Database» more  SBBD 2000»
13 years 8 months ago
Fast Feature Selection Using Fractal Dimension
Dimensionalitycurse and dimensionalityreduction are two issues that have retained highinterest for data mining, machine learning, multimedia indexing, and clustering. We present a...
Caetano Traina Jr., Agma J. M. Traina, Leejay Wu, ...
AMR
2008
Springer
248views Multimedia» more  AMR 2008»
13 years 9 months ago
Mobile Museum Guide Based on Fast SIFT Recognition
Abstract. This article explores the feasibility of a market-ready, mobile pattern recognition system based on the latest findings in the field of object recognition and currently a...
Boris Ruf, Effrosini Kokiopoulou, Marcin Detynieck...
ICASSP
2011
IEEE
12 years 11 months ago
Fast damped gauss-newton algorithm for sparse and nonnegative tensor factorization
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
Anh Huy Phan, Petr Tichavský, Andrzej Cicho...