192 search results - page 8 / 39 » Boolean Matching Using Generalized Reed-Muller Forms |
111
click to vote
KCAP
2005
ACM
15 years 5 months ago
2005
ACM
An ultimate goal of AI is to build end-to-end systems that interpret natural language, reason over the resulting logical forms, and perform actions based on that reasoning. This r...
110
click to vote
ICALP
2007
Springer
15 years 5 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
EDBT
2009
ACM
15 years 3 months ago
2009
ACM
Schema mappings define relationships between schemas in a declarative way. We demonstrate MVT, a mapping validation tool that allows the designer to ask whether the mapping has ce...
JCB
2006
14 years 11 months ago
2006
A stochastic genetic toggle switch model that consists of two identical, mutually repressive genes is built using the Gillespie algorithm with time delays as an example of a simpl...
105
click to vote
EMNLP
2009
14 years 9 months ago
2009
User clicks on a URL in response to a query are extremely useful predictors of the URL's relevance to that query. Exact match click features tend to suffer from severe data s...