Sciweavers

1658 search results - page 128 / 332
» Learning Unknown Graphs
Sort
View
COMBINATORICA
2010
15 years 1 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
IROS
2006
IEEE
132views Robotics» more  IROS 2006»
15 years 10 months ago
Supervised Learning of Topological Maps using Semantic Information Extracted from Range Data
Abstract— This paper presents an approach to create topological maps from geometric maps obtained with a mobile robot in an indoor-environment using range data. Our approach util...
Óscar Martínez Mozos, Wolfram Burgar...
EMNLP
2008
15 years 6 months ago
Soft-Supervised Learning for Text Classification
We propose a new graph-based semisupervised learning (SSL) algorithm and demonstrate its application to document categorization. Each document is represented by a vertex within a ...
Amarnag Subramanya, Jeff Bilmes
155
Voted
IJAR
2010
152views more  IJAR 2010»
15 years 3 months ago
Structural-EM for learning PDG models from incomplete data
Probabilistic Decision Graphs (PDGs) are a class of graphical models that can naturally encode some context specific independencies that cannot always be efficiently captured by...
Jens D. Nielsen, Rafael Rumí, Antonio Salme...
121
Voted
ECTEL
2007
Springer
15 years 10 months ago
Adaptation of the ACO Heuristic for Sequencing Learning Activities
This paper describes an initiative aimed at adapting swarm intelligence techniques (in particular, Ant Colony Optimization) to an e-learning environment, thanks to the fact that th...
Sergio Gutiérrez Santos, Grégory Val...