523 search results - page 98 / 105 » Decidability of string graphs |
202
Voted
ICMLC
2010
Springer
15 years 3 months ago
2010
Springer
: This paper presents a system for predicting dangerous driving events while driving on an expressway. There are three major tasks involved in the prediction system: (1) how to per...
175
click to vote
TOC
2010
15 years 16 days ago
2010
: We define quantum expanders in a natural way and give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...
154
click to vote
AAAI
2011
14 years 5 months ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
265
click to vote
CIE
2011
Springer
14 years 5 months ago
2011
Springer
Automatic classes are classes of languages for which a finite automaton can decide whether a given element is in a set given by its index. The present work studies the learnabilit...
159
click to vote
DIS
2005
Springer
15 years 11 months ago
2005
Springer
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...