Sciweavers

921 search results - page 7 / 185
» New Data Structures for Orthogonal Range Searching
Sort
View
SSDBM
2009
IEEE
192views Database» more  SSDBM 2009»
14 years 2 months ago
MLR-Index: An Index Structure for Fast and Scalable Similarity Search in High Dimensions
High-dimensional indexing has been very popularly used for performing similarity search over various data types such as multimedia (audio/image/video) databases, document collectio...
Rahul Malik, Sangkyum Kim, Xin Jin, Chandrasekar R...
ESA
2010
Springer
183views Algorithms» more  ESA 2010»
13 years 8 months ago
Spatio-temporal Range Searching over Compressed Kinetic Sensor Data
As sensor networks increase in size and number, efficient techniques are required to process the very large data sets that they generate. Frequently, sensor networks monitor object...
Sorelle A. Friedler, David M. Mount
IWMMDBMS
1996
64views more  IWMMDBMS 1996»
13 years 8 months ago
Spatial Indexing into Compressed Raster Images: How to Answer Range Queries Without Decompression
The maintenance of large raster images under spatial operations is still a major performance bottleneck. For reasons of storage space, images in a collection, such as satellite pi...
Renato Pajarola, Peter Widmayer
IGARSS
2010
13 years 5 months ago
Spatial preprocessing for endmember extraction using unsupervised clustering and orthogonal subspace projection concepts
In this paper, we develop a new spatial preprocessing strategy which can be applied prior to a spectral-based endmember extraction process for unmixing of hyperspectral data. Our ...
Gabriel Martin, Antonio J. Plaza
PAMI
2007
102views more  PAMI 2007»
13 years 7 months ago
Feature Subset Selection and Ranking for Data Dimensionality Reduction
—A new unsupervised forward orthogonal search (FOS) algorithm is introduced for feature selection and ranking. In the new algorithm, features are selected in a stepwise way, one ...
Hua-Liang Wei, Stephen A. Billings