Sciweavers

462 search results - page 24 / 93
» Covering a Tree by a Forest
Sort
View
COMBINATORICS
1999
63views more  COMBINATORICS 1999»
13 years 7 months ago
Coverings, Heat Kernels and Spanning Trees
Fan R. K. Chung, S.-T. Yau
ICIAP
2009
ACM
13 years 5 months ago
Tree Covering within a Graph Kernel Framework for Shape Classification
Abstract. Shape classification using graphs and skeletons usually involves edition processes in order to reduce the influence of structural noise. However, edition distances can no...
François-Xavier Dupé, Luc Brun
PRL
2007
166views more  PRL 2007»
13 years 6 months ago
Boosted Landmarks of Contextual Descriptors and Forest-ECOC: A novel framework to detect and classify objects in cluttered scene
In this paper, we present a novel methodology to detect and recognize objects in cluttered scenes by proposing boosted contextual descriptors of landmarks in a framework of multi-...
Sergio Escalera, Oriol Pujol, Petia Radeva
DAGSTUHL
2007
13 years 8 months ago
Agents, Norms and Forest Cleaning
The automation of forest cleaning presupposes principles for choosing those trees that ought to be taken away and those that shall be left standing. In this paper, which is a repor...
Jan Odelstad
BMCBI
2010
178views more  BMCBI 2010»
13 years 7 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...