1640 search results - page 14 / 328 » Conditional Independence Trees |
120
click to vote
ECML
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Conditional Random Fields (CRFs) provide a powerful instrument for labeling sequences. So far, however, CRFs have only been considered for labeling sequences over flat al...
DASFAA
2005
IEEE
15 years 8 months ago
2005
IEEE
Naive Bayes has been widely used in data mining as a simple and effective classification algorithm. Since its conditional independence assumption is rarely true, numerous algorit...
135
click to vote
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
Image parsing remains difficult due to the need to combine
local and contextual information when labeling a
scene. We approach this problem by using the epitome as a
prior over ...
108
click to vote
FSS
2006
15 years 2 months ago
2006
A tree series over a semiring with partially ordered carrier set can be considered as a fuzzy set. We investigate conditions under which it can also be understood as a fuzzied rec...
128
click to vote
IPL
2002
15 years 2 months ago
2002
Weak acceptance conditions for automata on infinite words or trees are defined in terms of the set of states that appear in the run. This is in contrast with, more usual, strong c...