Sciweavers

529 search results - page 56 / 106
» Query Processing for Distance Metrics
Sort
View
COCOON
1998
Springer
14 years 2 months ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...
ICASSP
2008
IEEE
14 years 4 months ago
Fine: Information embedding for document classification
The problem of document classification considers categorizing or grouping of various document types. Each document can be represented as a bag of words, which has no straightforw...
Kevin M. Carter, Raviv Raich, Alfred O. Hero
MMM
2005
Springer
128views Multimedia» more  MMM 2005»
14 years 3 months ago
Feature Combination and Relevance Feedback for 3D Model Retrieval
Retrieval of 3D models have attracted much research interest, and many types of shape features have been proposed. In this paper, we describe a novel approach of combining the fea...
Indriyati Atmosukarto, Wee Kheng Leow, Zhiyong Hua...
ICCV
2009
IEEE
1556views Computer Vision» more  ICCV 2009»
15 years 2 months ago
Kernel Methods for Weakly Supervised Mean Shift Clustering
Mean shift clustering is a powerful unsupervised data analysis technique which does not require prior knowledge of the number of clusters, and does not constrain the shape of th...
Oncel Tuzel, Fatih Porikli, Peter Meer
ISMIR
2000
Springer
176views Music» more  ISMIR 2000»
14 years 1 months ago
SEMEX - An efficient Music Retrieval Prototype
We present an efficient prototype for music information retrieval. The prototype uses bitparallel algorithms for locating transposition invariant matches of monophonic query melod...
Kjell Lemström, S. Perttu