1640 search results - page 45 / 328 » Conditional Independence Trees |
129
click to vote
CCR
1998
15 years 2 months ago
1998
Bandwidth-sensitive multicast delivery controlled by routing criteria pertinent to the actual traffic flow is very costly in terms of router state and control overhead and it scal...
105
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...
184
click to vote
PODC
2011
ACM
14 years 5 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
ISMIR
2005
Springer
15 years 8 months ago
2005
Springer
A system that segments and labels tabla strokes from real performances is described. Performance is evaluated on a large database taken from three performers under different recor...
124
Voted
PKDD
2007
Springer
15 years 8 months ago
2007
Springer
A relevance filter is proposed which removes features based on the mutual information between class labels and features. It is proven that both feature independence and class condi...