Sciweavers

2085 search results - page 352 / 417
» Linguistic Knowledge can Improve Information Retrieval
Sort
View
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
15 years 10 months ago
Towards 3-query locally decodable codes of subexponential length
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 2 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
GIS
2010
ACM
14 years 8 months ago
Reverse k-Nearest Neighbor monitoring on mobile objects
In this paper we focus on the problem of continuously monitoring the set of Reverse k-Nearest Neighbors (RkNNs) of a query object in a moving object database using a client server...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
MIR
2004
ACM
125views Multimedia» more  MIR 2004»
15 years 3 months ago
Autonomous visual model building based on image crawling through internet search engines
In this paper, we propose an autonomous learning scheme to automatically build visual semantic concept models from the output data of Internet search engines without any manual la...
Xiaodan Song, Ching-Yung Lin, Ming-Ting Sun
SIGMOD
2006
ACM
426views Database» more  SIGMOD 2006»
15 years 10 months ago
Effective keyword search in relational databases
With the amount of available text data in relational databases growing rapidly, the need for ordinary users to search such information is dramatically increasing. Even though the ...
Fang Liu, Clement T. Yu, Weiyi Meng, Abdur Chowdhu...