1640 search results - page 2 / 328 » Conditional Independence Trees |
CORR
2006
Springer
14 years 11 months ago
2006
Springer
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
86
Voted
GC
2010
Springer
14 years 10 months ago
2010
Springer
In this paper, we give a sufficient condition for a graph to have a degree bounded spanning tree. Let n ≥ 1, k ≥ 3, c ≥ 0 and G be an n-connected graph. Suppose that for eve...
86
Voted
CORR
2008
Springer
14 years 11 months ago
2008
Springer
We consider the problem of decentralized detection in a network consisting of a large number of nodes arranged as a tree of bounded height, under the assumption of conditionally in...
95
Voted
COMBINATORICS
2000
14 years 11 months ago
2000
Consider a connected r-regular n-vertex graph G with random independent edge lengths, each uniformly distributed on [0, 1]. Let mst(G) be the expected length of a minimum spanning...
AUSAI
2004
Springer
15 years 5 months ago
2004
Springer
Speech recognition technique is expected to make a great impact on many user interface areas such as toys, mobile phones, PDAs, and home appliances. Those applications basically re...