1199 search results - page 89 / 240 » Robust inference of trees |
128
click to vote
ICRA
2007
IEEE
15 years 10 months ago
2007
IEEE
— Randomly expanding trees are very effective in exploring high-dimensional spaces. Consequently, they are a powerful algorithmic approach to sampling-based single-query motion p...
113
click to vote
ICML
2003
IEEE
16 years 4 months ago
2003
IEEE
Over the past few years, a number of approximate inference algorithms for networked data have been put forth. We empirically compare the performance of three of the popular algori...
152
click to vote
SIBGRAPI
2008
IEEE
15 years 10 months ago
2008
IEEE
This work proposes a simple approximation scheme for discrete data that leads to an infinitely smooth result without global optimization. It combines the flexibility of Binary Sp...
118
click to vote
LCN
2007
IEEE
15 years 10 months ago
2007
IEEE
- Multiple distribution trees and multiple description (MD) coding are highly robust since they provide redundancy both in network paths and data. However, MD coded streaming inclu...
130
click to vote
OPODIS
2004
15 years 5 months ago
2004
Abstract. Ad-hoc networks do not provide an infrastructure for communication such as routers and are characterized by 1) quick changes of communication topology and 2) unstable sys...