Sciweavers

342 search results - page 15 / 69
» Higher order learning with graphs
Sort
View
109
Voted
JETAI
1998
110views more  JETAI 1998»
15 years 1 months ago
Independency relationships and learning algorithms for singly connected networks
Graphical structures such as Bayesian networks or Markov networks are very useful tools for representing irrelevance or independency relationships, and they may be used to e cientl...
Luis M. de Campos
154
Voted
MIR
2006
ACM
223views Multimedia» more  MIR 2006»
15 years 7 months ago
Adaptive image retrieval using a Graph model for semantic feature integration
The variety of features available to represent multimedia data constitutes a rich pool of information. However, the plethora of data poses a challenge in terms of feature selectio...
Jana Urban, Joemon M. Jose
ICPR
2008
IEEE
16 years 3 months ago
Image retrieval with graph kernel on regions
In the framework of the interactive search in image databases, we are interested in similarity measures able to learn during the search and usable in real-time. Images are represe...
Justine Lebrun, Sylvie Philipp-Foliguet, Philippe ...
87
Voted
ISAAC
2003
Springer
144views Algorithms» more  ISAAC 2003»
15 years 7 months ago
Biconnectivity on Symbolically Represented Graphs: A Linear Solution
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...
Raffaella Gentilini, Alberto Policriti
145
Voted
COMBINATORICA
2010
14 years 11 months ago
A randomized embedding algorithm for trees
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
Benny Sudakov, Jan Vondrák