Sciweavers

6740 search results - page 1069 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
PAMI
2006
145views more  PAMI 2006»
15 years 6 months ago
Convergent Tree-Reweighted Message Passing for Energy Minimization
Algorithms for discrete energy minimization are of fundamental importance in computer vision. In this paper we focus on the recent technique proposed by Wainwright et al. [33] - t...
Vladimir Kolmogorov
IJCV
2007
115views more  IJCV 2007»
15 years 6 months ago
Discovering Shape Classes using Tree Edit-Distance and Pairwise Clustering
This paper describes work aimed at the unsupervised learning of shape-classes from shock trees. We commence by considering how to compute the edit distance between weighted trees. ...
Andrea Torsello, Antonio Robles-Kelly, Edwin R. Ha...
TROB
2008
86views more  TROB 2008»
15 years 6 months ago
Visual SLAM for Flying Vehicles
The ability to learn a map of the environment is important for numerous types of robotic vehicles. In this paper, we address the problem of learning a visual map of the ground usin...
Bastian Steder, Giorgio Grisetti, Cyrill Stachniss...
COR
2004
111views more  COR 2004»
15 years 6 months ago
Multiple multicast tree allocation in IP network
The multicasting is defined as the distribution of the same information stream from one to many nodes concurrently. There has been an intensive research effort to design protocols...
Chae Y. Lee, Hee K. Cho
JAR
2000
90views more  JAR 2000»
15 years 6 months ago
Resolution versus Search: Two Strategies for SAT
The paper compares two popular strategies for solving propositional satis ability, backtracking search and resolution, and analyzes the complexity of a directional resolution algo...
Irina Rish, Rina Dechter
« Prev « First page 1069 / 1348 Last » Next »