3105 search results - page 115 / 621 » The Path-Packing Structure of Graphs |
149
click to vote
TALG
2008
15 years 3 months ago
2008
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
155
Voted
CVPR
2011
IEEE
14 years 11 months ago
2011
IEEE
Nearly every structured prediction problem in computer vision requires approximate inference due to large and complex dependencies among output labels. While graphical models prov...
157
Voted
EJC
2011
14 years 10 months ago
2011
A D-polyhedron is a polyhedron P such that if x, y are in P then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive latti...
135
click to vote
TCOM
2011
14 years 10 months ago
2011
—Low-density parity-check (LDPC) codes are gaining interest for high data rate applications in both terrestrial and spatial communications. They can be designed and studied throu...
171
click to vote
KI
2010
Springer
14 years 10 months ago
2010
Springer
In this paper, we address the problem of lifelong map learning in static environments with mobile robots using the graph-based formulation of the simultaneous localization and mapp...