1143 search results - page 106 / 229 » Querying Probabilistic Information Extraction |
125
click to vote
EMNLP
2009
14 years 10 months ago
2009
There have been increasing needs for task specific rankings in web search such as rankings for specific query segments like long queries, time-sensitive queries, navigational quer...
103
Voted
STOC
2007
ACM
16 years 1 months ago
2007
ACM
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...
111
Voted
CLEF
2010
Springer
15 years 1 months ago
2010
Springer
This paper presents the UESTC contribution to the ImageCLEF 2010 medical retrieval task. For ad-hoc retrieval and case-based retrieval, we only use text information, and propose a ...
116
click to vote
SPAA
2009
ACM
16 years 1 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
136
click to vote
INFOSCALE
2007
ACM
15 years 2 months ago
2007
ACM
Large-scale Parallel Web Search Engines (WSEs) needs to adopt a strategy for partitioning the inverted index among a set of parallel server nodes. In this paper we are interested ...