2434 search results - page 379 / 487 » Algorithmic Randomness of Closed Sets |
149
Voted
IJCAI
2007
15 years 4 months ago
2007
The task of learning models for many real-world problems requires incorporating domain knowledge into learning algorithms, to enable accurate learning from a realistic volume of t...
100
Voted
IJCAI
2007
15 years 4 months ago
2007
Numerous logics have been developed for reasoning about inconsistency which differ in (i) the logic to which they apply, and (ii) the criteria used to draw inferences. In this pap...
131
click to vote
SDM
2008
SIAM
15 years 4 months ago
2008
SIAM
The rigid all-versus-all adjacency required by a maximal biclique for its two vertex sets is extremely vulnerable to missing data. In the past, several types of quasi-bicliques ha...
104
click to vote
ECIR
2006
Springer
15 years 4 months ago
2006
Springer
Current research in the field of automatic plagiarism detection for text documents focuses on algorithms that compare plagiarized documents against potential original documents. Th...
128
click to vote
IJCAI
2003
15 years 4 months ago
2003
We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can...