3731 search results - page 444 / 747 » cases 2006 |
165
click to vote
JCSS
2010
15 years 5 months ago
2010
We present solutions for the k-mismatch pattern matching problem with don’t cares. Given a text t of length n and a pattern p of length m with don’t care symbols and a bound k...
198
click to vote
JCSS
2010
15 years 5 months ago
2010
To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated acc...
168
click to vote
JCT
2010
15 years 5 months ago
2010
The vertex Folkman number F(r, n, m), n < m, is the smallest integer t such that there exists a Km-free graph of order t with the property that every r-coloring of its vertices...
151
click to vote
JFP
2010
15 years 5 months ago
2010
The aim of our work is to be able to do fully formal, machine verified proofs over Generic Haskellstyle polytypic programs. In order to achieve this goal, we embed polytypic prog...
153
click to vote
JMLR
2010
15 years 5 months ago
2010
The problem is sequence prediction in the following setting. A sequence x1, . . . , xn, . . . of discrete-valued observations is generated according to some unknown probabilistic ...