Sciweavers

269 search results - page 25 / 54
» Fast Parallel Similarity Search in Multimedia Databases
Sort
View
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
16 years 4 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
ICMCS
2008
IEEE
151views Multimedia» more  ICMCS 2008»
15 years 11 months ago
Fast keyword detection with sparse time-frequency models
We address the problem of keyword spotting in continuous speech streams when training and testing conditions can be different. We propose a keyword spotting algorithm based on spa...
Effrosini Kokiopoulou, Pascal Frossard, Olivier Ve...
BMCBI
2011
14 years 8 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes
201
Voted
TMM
2010
199views Management» more  TMM 2010»
14 years 11 months ago
Video Annotation Through Search and Graph Reinforcement Mining
Abstract--Unlimited vocabulary annotation of multimedia documents remains elusive despite progress solving the problem in the case of a small, fixed lexicon. Taking advantage of th...
Emily Moxley, Tao Mei, Bangalore S. Manjunath
MMDB
2004
ACM
153views Multimedia» more  MMDB 2004»
15 years 10 months ago
A PCA-based similarity measure for multivariate time series
Multivariate time series (MTS) datasets are common in various multimedia, medical and financial applications. We propose a similarity measure for MTS datasets, Eros (Extended Fro...
Kiyoung Yang, Cyrus Shahabi