Sciweavers

73 search results - page 1 / 15
» Thin Junction Trees
Sort
View
NIPS
2001
13 years 6 months ago
Thin Junction Trees
We present an algorithm that induces a class of models with thin junction trees--models that are characterized by an upper bound on the size of the maximal cliques of their triang...
Francis R. Bach, Michael I. Jordan
MR
2008
94views Robotics» more  MR 2008»
13 years 4 months ago
Stress intensities at the triple junction of a multilevel thin film package
Stress intensities of a singular near-tip field around the vertex of a triple junction wedge in multilevel thin film packages are calculated using the two-state M-integral. For th...
Insu Jeon, Ki-Ju Kang, Seyoung Im
ICPR
2000
IEEE
13 years 9 months ago
Vectorization in Graphics Recognition: To Thin or Not to Thin
Vectorization, i.e. raster–to–vector conversion, is a central part of graphics recognition problems. In this paper, we discuss the pros and the cons of basing one’s vectoriz...
Karl Tombre, Salvatore Tabbone
ICRA
2005
IEEE
129views Robotics» more  ICRA 2005»
13 years 10 months ago
Exactly Sparse Delayed-State Filters
— This paper presents the novel insight that the SLAM information matrix is exactly sparse in a delayedstate framework. Such a framework is used in view-based representations of ...
Ryan Eustice, Hanumant Singh, John J. Leonard