2954 search results - page 393 / 591 » Beyond |
148
click to vote
AAAI
2000
15 years 6 months ago
2000
A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guarante...
135
click to vote
AAAI
2000
15 years 6 months ago
2000
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...
132
click to vote
ACL
1998
15 years 6 months ago
1998
Since the early Sixties and Seventies it has been known that the regular and context-free languages arc characterized by definability in the monadic second-order theory of certain...
152
click to vote
UAI
2003
15 years 6 months ago
2003
We formulate a principle for classification with the knowledge of the marginal distribution over the data points (unlabeled data). The principle is cast in terms of Tikhonov styl...
168
click to vote
COLING
2000
15 years 6 months ago
2000
When aligning texts in very different languages such as Korean and English, structural features beyond word or phrase give useful intbrmation. In this paper, we present a method f...