3134 search results - page 221 / 627 » Computing full disjunctions |
144
click to vote
TIT
2002
15 years 3 months ago
2002
Prediction of individual sequences is investigated for cases in which the decision maker observes a delayed version of the sequence, or is forced to issue his/her predictions a nu...
129
click to vote
JAPLL
2010
15 years 2 months ago
2010
We introduce the extended modal logic EML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as nu...
120
click to vote
EMNLP
2009
15 years 1 months ago
2009
Randomised techniques allow very big language models to be represented succinctly. However, being batch-based they are unsuitable for modelling an unbounded stream of language whi...
143
Voted
DASFAA
2009
IEEE
15 years 10 months ago
2009
IEEE
Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...
146
Voted
ECEASST
2010
14 years 11 months ago
2010
In this paper we introduce a MySQL code generator for a significant subset of OCL expressions which is based on the use of stored procedures for mapping OCL iterators. Our code gen...