2478 search results - page 253 / 496 » Universality in two dimensions |
160
click to vote
NDJFL
1998
15 years 6 months ago
1998
A linear order is n-decidable if its universe is N and the relations determined by n formulas are uniformly computable. This means that there is a computable procedure which, when ...
207
click to vote
RSKT
2010
Springer
15 years 5 months ago
2010
Springer
A naive Bayesian classifier is a probabilistic classifier based on Bayesian decision theory with naive independence assumptions, which is often used for ranking or constructing a...
177
click to vote
TAL
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We describe OpenMaTrEx, a free/open-source examplebased machine translation (EBMT) system based on the marker hypothesis, comprising a marker-driven chunker, a collection...
160
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...
181
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Grounding is the task of reducing a first order formula to ground formula that is equivalent on a given universe, and is important in many kinds of problem solving and re...