2099 search results - page 60 / 420 » Similarity for Conceptual Querying |
101
click to vote
WEBI
2010
Springer
14 years 7 months ago
2010
Springer
Latent relational search is a new search paradigm based on the degree of analogy between two word pairs. A latent relational search engine is expected to return the word Paris as a...
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, we prove for the first time that the learning complexity of Rocchio’s algorithm is O(d+d2 (log d+log n)) over the discretized vector space {0, . . . , n − 1}d ,...
106
click to vote
BIBE
2003
IEEE
15 years 3 months ago
2003
IEEE
We present a multi-dimensional indexing approach for fast sequence similarity search in DNA and protein databases. In particular, we propose effective transformations of subsequen...
WWW
2008
ACM
15 years 10 months ago
2008
ACM
For extracting the characteristics a specific geographic entity, and notably a place, we propose to use dynamic Extreme Tagging Systems in combination with the classic approach of...
ER
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. In this paper we argue that many of the problems one may experience while visiting websites today may be avoided if their builders adopt a proper methodology for designin...