Sciweavers

2912 search results - page 38 / 583
» Logistic Model Trees
Sort
View
ISVC
2010
Springer
13 years 9 months ago
Attention-Based Target Localization Using Multiple Instance Learning
Abstract. We propose a novel Multiple Instance Learning (MIL) framework to perform target localization from image sequences. The proposed approach consists of a softmax logistic re...
Karthik Sankaranarayanan, James W. Davis
LICS
2006
IEEE
14 years 5 months ago
On Model-Checking Trees Generated by Higher-Order Recursion Schemes
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
C.-H. Luke Ong
ESA
2009
Springer
190views Algorithms» more  ESA 2009»
14 years 2 months ago
Polynomial-Time Algorithm for the Leafage of Chordal Graphs
Every chordal graph G can be represented as the intersection graph of a collection of subtrees of a host tree, the so-called tree model of G. The leafage l(G) of a connected chorda...
Michel Habib, Juraj Stacho
JOBIM
2000
14 years 2 months ago
Can We Have Confidence in a Tree Representation?
Abstract. A tree representation distance method, applied to any dissimilarity array, always gives a valued tree, even if the tree model is not appropriate. In the first part, we pr...
Alain Guénoche, Henri Garreta
ICALP
2005
Springer
14 years 4 months ago
Logics for Unranked Trees: An Overview
Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purpo...
Leonid Libkin