Sciweavers

1658 search results - page 3 / 332
» Learning Unknown Graphs
Sort
View
UAI
2008
13 years 7 months ago
Bayesian Out-Trees
A Bayesian treatment of latent directed graph structure for non-iid data is provided where each child datum is sampled with a directed conditional dependence on a single unknown p...
Tony Jebara
ICRA
1999
IEEE
138views Robotics» more  ICRA 1999»
13 years 10 months ago
Efficient Topological Exploration
We consider the robot exploration of a planar graphlike world. The robot's goal is to build a complete map of its environment. The environment is modeled as an arbitrary undi...
Ioannis M. Rekleitis, Vida Dujmovic, Gregory Dudek
ECCV
2008
Springer
14 years 7 months ago
Feature Correspondence Via Graph Matching: Models and Global Optimization
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter an...
Lorenzo Torresani, Vladimir Kolmogorov, Carsten Ro...
TIP
2008
124views more  TIP 2008»
13 years 5 months ago
Graph Laplacian Tomography From Unknown Random Projections
We introduce a graph Laplacian based algorithm for the tomography reconstruction of a planar object from its projections taken at random unknown directions. The algorithm is shown ...
Ronald R. Coifman, Yoel Shkolnisky, Fred J. Sigwor...
ICDM
2008
IEEE
121views Data Mining» more  ICDM 2008»
14 years 5 days ago
Unifying Unknown Nodes in the Internet Graph Using Semisupervised Spectral Clustering
Most research on Internet topology is based on active measurement methods. A major difficulty in using these tools is that one comes across many unresponsive routers. Different m...
Anat Almog, Jacob Goldberger, Yuval Shavitt