Sciweavers

3396 search results - page 164 / 680
» Tree representations of graphs
Sort
View
ILP
2007
Springer
14 years 3 months ago
Learning with Kernels and Logical Representations
In this chapter, we describe a view of statistical learning in the inductive logic programming setting based on kernel methods. The relational representation of data and background...
Paolo Frasconi
ISSAC
1994
Springer
165views Mathematics» more  ISSAC 1994»
14 years 1 months ago
Constructing Permutation Representations for Large Matrix Groups
New techniques, both theoretical and practical, are presented for constructing a permutation representation for a matrix group. We assume that the resulting permutation degree, n,...
Gene Cooperman, Larry Finkelstein, Bryant W. York,...
LREC
2010
202views Education» more  LREC 2010»
13 years 10 months ago
Can Syntactic and Logical Graphs help Word Sense Disambiguation?
This paper presents a word sense disambiguation (WSD) approach based on syntactic and logical representations. The objective here is to run a number of experiments to compare stan...
Amal Zouaq, Michel Gagnon, Benoît Ozell
ICIP
2003
IEEE
14 years 10 months ago
Redundant representation with complex wavelets: how to achieve sparsity
Overcomplete transforms, like the Dual-Tree Complex Wavelet Transform, offer more flexible signal representations than critically-sampled transforms, due to their properties of sh...
Nick G. Kingsbury, Tanya Reeves
CORR
2011
Springer
174views Education» more  CORR 2011»
13 years 4 months ago
Lower bounds on the obstacle number of graphs
Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices ...
Padmini Mukkamala, János Pach, Döm&oum...