1640 search results - page 152 / 328 » Conditional Independence Trees |
119
Voted
ICDAR
2009
IEEE
15 years 8 days ago
2009
IEEE
A new method of logo detection in document images is proposed in this paper. It is based on the boundary extension of feature rectangles of which the definition is also given in t...
148
Voted
IWPEC
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...
142
click to vote
AAAI
1996
15 years 3 months ago
1996
Recent work in supervised learning has shown that a surprisingly simple Bayesian classifier with strong assumptions of independence among features, called naive Bayes, is competit...
132
click to vote
NAACL
2010
15 years 13 days ago
2010
Syntactic machine translation systems extract rules from bilingual, word-aligned, syntactically parsed text, but current systems for parsing and word alignment are at best cascade...
155
click to vote
COCOON
2009
Springer
15 years 9 months ago
2009
Springer
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...