Sciweavers

1283 search results - page 7 / 257
» Probabilistic structured query methods
Sort
View
IPL
2006
103views more  IPL 2006»
13 years 7 months ago
On the cost of searching signature trees
A precise analysis of the retrieval of signature trees is presented. A signature tree is a data structure constructed over a signature file to speed up searching all those signatu...
Yangjun Chen
ACL
2011
12 years 11 months ago
Joint Annotation of Search Queries
Marking up search queries with linguistic annotations such as part-of-speech tags, capitalization, and segmentation, is an important part of query processing and understanding in ...
Michael Bendersky, W. Bruce Croft, David A. Smith
EMNLP
2011
12 years 7 months ago
Watermarking the Outputs of Structured Prediction with an application in Statistical Machine Translation
We propose a general method to watermark and probabilistically identify the structured outputs of machine learning algorithms. Our method is robust to local editing operations and...
Ashish Venugopal, Jakob Uszkoreit, David Talbot, F...
CIVR
2007
Springer
185views Image Analysis» more  CIVR 2007»
14 years 1 months ago
Z-grid-based probabilistic retrieval for scaling up content-based copy detection
Scalability is the key issue in making content-based copy detection (CBCD) methods practical for very large image and video databases. Since copies are transformed versions of ori...
Sébastien Poullot, Olivier Buisson, Michel ...
ECIR
2009
Springer
14 years 4 months ago
A Probabilistic Retrieval Model for Semistructured Data
Abstract. Retrieving semistructured (XML) data typically requires either a structured query such as XPath, or a keyword query that does not take structure into account. In this pap...
Jinyoung Kim, Xiaobing Xue, W. Bruce Croft