638 search results - page 25 / 128 » Applications of Approximate Word Matching in Information Ret... |
143
Voted
SPIRE
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
180
click to vote
AUTOMATICA
2008
15 years 5 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
141
click to vote
IRI
2009
IEEE
16 years 7 days ago
2009
IEEE
Traditional schema matchers use a set of distinct simple matchers and use a composition function to combine the individual scores using an arbitrary order of matcher application l...
136
Voted
ICMCS
2006
IEEE
15 years 11 months ago
2006
IEEE
In this paper, we demonstrate a novel poster image matching system for wireless multimedia applications. We propose a method that incorporates both color and layout information of...
152
Voted
ISMIR
2005
Springer
15 years 11 months ago
2005
Springer
In the “query-by-humming” problem, we attempt to retrieve a specific song from a target set based on a sung query. Recent evaluations of query-by-humming systems show that th...