1640 search results - page 120 / 328 » Conditional Independence Trees |
129
click to vote
AINA
2006
IEEE
15 years 5 months ago
2006
IEEE
In this paper, we study the problem of data gathering in multi-hop wireless sensor networks. To tackle the high degree of channel contention and high probability of packet collisi...
160
click to vote
OSDI
2000
ACM
15 years 4 months ago
2000
ACM
Overcast is an application-level multicasting system that can be incrementally deployed using today's Internet infrastructure. These properties stem from Overcast's impl...
123
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
114
click to vote
SIAMDM
2008
15 years 3 months ago
2008
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...
150
Voted
DMIN
2009
15 years 1 months ago
2009
When performing concept description, models need to be evaluated both on accuracy and comprehensibility. A comprehensible concept description model should present the most importan...