Sciweavers

50 search results - page 5 / 10
» Regular Languages Are Testable with a Constant Number of Que...
Sort
View
PLDI
2010
ACM
14 years 4 months ago
A Context-free Markup Language for Semi-structured Text
An ad hoc data format is any non-standard, semi-structured data format for which robust data processing tools are not available. In this paper, we present ANNE, a new kind of mark...
Qian Xi, David Walker
ALT
1997
Springer
13 years 11 months ago
Learning One-Variable Pattern Languages Very Efficiently on Average, in Parallel, and by Asking Queries
A pattern is a string of constant and variable symbols. The language generated by a pattern is the set of all strings of constant symbols which can be obtained from by substituti...
Thomas Erlebach, Peter Rossmanith, Hans Stadtherr,...
SIGIR
2006
ACM
14 years 1 months ago
Regularized estimation of mixture models for robust pseudo-relevance feedback
Pseudo-relevance feedback has proven to be an effective strategy for improving retrieval accuracy in all retrieval models. However the performance of existing pseudo feedback meth...
Tao Tao, ChengXiang Zhai
ICMCS
1999
IEEE
131views Multimedia» more  ICMCS 1999»
13 years 11 months ago
Integrating Web Resources and Lexicons into a Natural Language Query System
The START system responds to natural language queries with answers in text, pictures, and other media. START's sentence-level natural language parsing relies on a number of m...
Boris Katz, Deniz Yuret, Jimmy J. Lin, Sue Felshin...
DKE
2007
101views more  DKE 2007»
13 years 7 months ago
Parameterized pattern queries
We introduce parameterized pattern queries as a new paradigm to extend traditional pattern expressions over sequence databases. A parameterized pattern is essentially a string mad...
Cédric du Mouza, Philippe Rigaux, Michel Sc...