Sciweavers

427 search results - page 11 / 86
» Computing the Local Consensus of Trees
Sort
View
88
Voted
ISAAC
2003
Springer
70views Algorithms» more  ISAAC 2003»
15 years 2 months ago
Settling the Intractability of Multiple Alignment
In this paper some of the most fundamental problems in computational biology are proved intractable. The following problems are shown NP-hard for all binary or larger alphabets und...
Isaac Elias
VTC
2010
IEEE
178views Communications» more  VTC 2010»
14 years 7 months ago
Nonparametric Belief Propagation Based on Spanning Trees for Cooperative Localization in Wireless Sensor Networks
—Nonparametric belief propagation (NBP) is one of the best-known methods for cooperative localization in sensor networks. It is capable to provide information about location esti...
Vladimir Savic, Santiago Zazo
INFOCOM
2008
IEEE
15 years 3 months ago
Which Distributed Averaging Algorithm Should I Choose for my Sensor Network?
Average consensus and gossip algorithms have recently received significant attention, mainly because they constitute simple and robust algorithms for distributed information proc...
Patrick Denantes, Florence Bénézit, ...
ICVS
2003
Springer
15 years 2 months ago
Tree Supported Road Extraction from Arial Images Using Global and Local Context Knowledge
The quality control and update of geo-data, in this case especially of road-data, is the primary aim of the system, which is presented in the paper. One important task of the syste...
Matthias Butenuth, Bernd-Michael Straub, Christian...
ICRA
2009
IEEE
259views Robotics» more  ICRA 2009»
15 years 4 months ago
Fast Point Feature Histograms (FPFH) for 3D registration
— In our recent work [1], [2], we proposed Point Feature Histograms (PFH) as robust multi-dimensional features which describe the local geometry around a point p for 3D point clo...
Radu Bogdan Rusu, Nico Blodow, Michael Beetz