Sciweavers

224 search results - page 28 / 45
» The optimal sequenced route query
Sort
View
224
Voted
ICDE
2005
IEEE
120views Database» more  ICDE 2005»
16 years 3 months ago
Progressive Distributed Top k Retrieval in Peer-to-Peer Networks
Query processing in traditional information management systems has moved from an exact match model to more flexible paradigms allowing cooperative retrieval by aggregating the dat...
Wolf-Tilo Balke, Wolfgang Nejdl, Wolf Siberski, Uw...
JUCS
2007
122views more  JUCS 2007»
15 years 1 months ago
Efficient Access Methods for Temporal Interval Queries of Video Metadata
: Indexing video content is one of the most important problems in video databases. In this paper we present linear time and space algorithms for handling video metadata that repres...
Spyros Sioutas, Kostas Tsichlas, Bill Vassiliadis,...
98
Voted
ISMIR
2004
Springer
119views Music» more  ISMIR 2004»
15 years 7 months ago
Time Series Alignment for Music Information Retrieval
Time series representations are common in MIR applications such as query-by-humming, where a sung query might be represented by a series of ‘notes’ for database retrieval. Whi...
Norman H. Adams, Mark A. Bartsch, Jonah Shifrin, G...
113
Voted
PR
2007
134views more  PR 2007»
15 years 1 months ago
An elastic partial shape matching technique
We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that b...
Longin Jan Latecki, Vasileios Megalooikonomou, Qia...
BMCBI
2011
14 years 5 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