499 search results - page 44 / 100 » Constructive Induction by Analogy |
WDAG
2001
Springer
14 years 3 days ago
2001
Springer
Abstract. We have a new proof of the lower bound that k-set agreement requires f/k + 1 rounds in a synchronous, message-passing model with f crash failures. The proof involves cons...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
This paper describes in details the first version of Morphonette, a new French morphological resource and a new radically lexeme-based method of morphological analysis. This resea...
ICDM
2008
IEEE
14 years 2 months ago
2008
IEEE
Motivated by the need for unification of the field of data mining and the growing demand for formalized representation of outcomes of research, we address the task of constructi...
JAL
1998
13 years 7 months ago
1998
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construct...
GD
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...