Sciweavers

773 search results - page 88 / 155
» Traversing the Machining Graph
Sort
View
ML
2011
ACM
179views Machine Learning» more  ML 2011»
14 years 4 months ago
Neural networks for relational learning: an experimental comparison
In the last decade, connectionist models have been proposed that can process structured information directly. These methods, which are based on the use of graphs for the representa...
Werner Uwents, Gabriele Monfardini, Hendrik Blocke...
ICML
2007
IEEE
15 years 10 months ago
Quantum clustering algorithms
By the term "quantization", we refer to the process of using quantum mechanics in order to improve a classical algorithm, usually by making it go faster. In this paper, ...
Esma Aïmeur, Gilles Brassard, Sébastie...
ICML
2005
IEEE
15 years 10 months ago
Error bounds for correlation clustering
This paper presents a learning theoretical analysis of correlation clustering (Bansal et al., 2002). In particular, we give bounds on the error with which correlation clustering r...
Thorsten Joachims, John E. Hopcroft
ICALT
2009
IEEE
15 years 4 months ago
Korean Word Associations: The Linked Structures for Language Learning
This paper reports on Korean Word Associations (KorWA) which were collected to construct a semantic network for Korean language. An approach of graph representation and network an...
Jaeyoung Jung, Nobuyasu Makoshi, Hiroyuki Akama
SAC
2004
ACM
15 years 3 months ago
A back-end for GHC based on categorical multi-combinators
is an abstract graph reduction machine for the implementation of lazy functional languages. Categorical multi-combinators served as a basis for the evaluation model of µΓCMC. Th...
Ricardo Massa Ferreira Lima, Rafael Dueire Lins, A...