Sciweavers

427 search results - page 33 / 86
» Computing the Local Consensus of Trees
Sort
View
IPPS
2007
IEEE
15 years 11 months ago
Power-Aware Routing for Well-Nested Communications On The Circuit Switched Tree
Although algorithms that employ dynamic reconfiguration are extremely fast, they need the underlying architecture to change structure very rapidly, possibly at each step of the c...
Hatem M. El-Boghdadi
DCC
2000
IEEE
15 years 9 months ago
Trees, Windows, and Tiles for Wavelet Image Compression
We investigate the task of compressing an image by using different probability models for compressing different regions of the image. In an earlier paper, we introduced a class of...
Wee Sun Lee
PDCAT
2004
Springer
15 years 10 months ago
An Optimal Broadcasting Algorithm for de Bruijn Network dBG(d, k)
Recent works have classified de Bruijn graph (dBG) based broadcasting algorithms into local broadcasting and arc-disjoint spanning trees based broadcasting. However, those algorit...
Ngoc Chi Nguyen, Sungyoung Lee
CVPR
1998
IEEE
16 years 7 months ago
The Sample Tree: A Sequential Hypothesis Testing Approach to 3D Object Recognition
A method is presented for e cient and reliable object recognition within noisy, cluttered, and occluded range images. The method is based on a strategy which hypothesizes the inte...
Michael A. Greenspan
ICRA
1999
IEEE
126views Robotics» more  ICRA 1999»
15 years 9 months ago
Monte Carlo Localization for Mobile Robots
Mobile robot localization is the problem of determining a robot's pose from sensor data. This article presents a family of probabilisticlocalization algorithms known as Monte...
Frank Dellaert, Dieter Fox, Wolfram Burgard, Sebas...