Sciweavers

9532 search results - page 399 / 1907
» Logic, Graphs, and Algorithms
Sort
View
JETAI
2002
71views more  JETAI 2002»
15 years 6 months ago
Comparing performance of algorithms for generating concept lattices
Several algorithms that generate the set of all formal concepts and diagram graphs of concept lattices are considered. Some modifications of wellknown algorithms are proposed. Algo...
Sergei O. Kuznetsov, Sergei A. Obiedkov
OA
1989
237views Algorithms» more  OA 1989»
15 years 10 months ago
Which Triangulations Approximate the Complete Graph?
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
Gautam Das, Deborah Joseph
MST
2006
129views more  MST 2006»
15 years 6 months ago
Reachability Problems on Regular Ground Tree Rewriting Graphs
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
Christof Löding
JSAI
2005
Springer
16 years 9 days ago
Learning Stochastic Logical Automaton
Abstract. This paper is concerned with algorithms for the logical generalisation of probabilistic temporal models from examples. The algorithms combine logic and probabilistic mode...
Hiroaki Watanabe, Stephen Muggleton
DIS
2005
Springer
16 years 10 days ago
Support Vector Inductive Logic Programming
Abstract. In this paper we explore a topic which is at the intersection of two areas of Machine Learning: namely Support Vector Machines (SVMs) and Inductive Logic Programming (ILP...
Stephen Muggleton, Huma Lodhi, Ata Amini, Michael ...