1067 search results - page 111 / 214 » Probabilistic regular graphs |
113
click to vote
ICDM
2005
IEEE
15 years 8 months ago
2005
IEEE
This paper presents the triple jump framework for accelerating the EM algorithm and other bound optimization methods. The idea is to extrapolate the third search point based on th...
190
click to vote
CVPR
2011
IEEE
15 years 17 days ago
2011
IEEE
Where does the sparsity in image signals come from? Local and nonlocal image models have supplied complementary views toward the regularity in natural images the former attempts t...
100
click to vote
IPL
2006
15 years 3 months ago
2006
Many real networks, including those in social, technological, and biological realms, are small-world networks. The two distinguishing characteristics of small-world networks are h...
127
click to vote
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
Point clouds are sets of points in two or three dimensions. Most kernel methods for learning on sets of points have not yet dealt with the specific geometrical invariances and pra...
113
click to vote
IROS
2009
IEEE
15 years 9 months ago
2009
IEEE
— We present a method for topological SLAM that specifically targets loop closing for edge-ordered graphs. Instead of using a heuristic approach to accept or reject loop closing...