Sciweavers

2883 search results - page 86 / 577
» Algorithms for merged indexes
Sort
View
CVPR
1997
IEEE
15 years 3 hour ago
Shape Indexing Using Approximate Nearest-Neighbour Search in High-Dimensional Spaces
Shape indexing is a way of making rapid associations between features detected in an image and object models that could have produced them. When model databases are large, the use...
Jeffrey S. Beis, David G. Lowe
ISM
2005
IEEE
132views Multimedia» more  ISM 2005»
14 years 3 months ago
A Pitch-Based Rapid Speech Segmentation for Speaker Indexing
Segmentation of continuous audio is important for speaker indexing. The reliability of models in speaker indexing depends much on segmentation. Commonly used method is based on th...
Min Yang, Yingchun Yang, Zhaohui Wu
ICIP
2004
IEEE
14 years 11 months ago
Statistical solution to watershed over-segmentation
A region based algorithm for segmentation motivated by a parallel implementation is introduced. It is obtained by combining the watershed transform with further merging based on a...
Valentin Gies, Thierry M. Bernard
ICPP
1993
IEEE
14 years 2 months ago
Solving the Region Growing Problem on the Connection Machine
Abstract { This paper presents a parallel algorithm for solving the region growing problem based on the split and merge approach. The algorithm was implemented on the CM-2 and the ...
Nawal Copty, Sanjay Ranka, Geoffrey Fox, Ravi V. S...
ICDE
2008
IEEE
168views Database» more  ICDE 2008»
14 years 4 months ago
Index Design for Dynamic Personalized PageRank
Personalized PageRank, related to random walks with restarts and conductance in resistive networks, is a frequent search paradigm for graph-structured databases. While efficient ba...
Amit Pathak, Soumen Chakrabarti, Manish S. Gupta