320 search results - page 18 / 64 » A New Compression Method with Fast Searching on Large Databa... |
190
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper, a new class of audio representations is introduced, together with a corresponding fast decomposition algorithm. The main feature of these representations is that th...
233
click to vote
BMCBI
2011
14 years 10 months ago
2011
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...
182
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
We propose a dynamic faceted search system for discoverydriven analysis on data with both textual content and structured attributes. From a keyword query, we want to dynamically s...
177
click to vote
VLDB
1997
ACM
15 years 10 months ago
1997
ACM
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
159
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
We introduce a method that enables scalable image search for learned metrics. Given pairwise similarity and dissimilarity constraints between some images, we learn a Mahalanobis d...