Sciweavers

15073 search results - page 265 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
IJAR
2006
125views more  IJAR 2006»
15 years 4 months ago
Computing best-possible bounds for the distribution of a sum of several variables is NP-hard
In many real-life situations, we know the probability distribution of two random variables x1 and x2, but we have no information about the correlation between x1 and x2; what are ...
Vladik Kreinovich, Scott Ferson
ICAS
2009
IEEE
147views Robotics» more  ICAS 2009»
15 years 11 months ago
Fast Estimation of Aggregates in Unstructured Networks
Aggregation of data values plays an important role on distributed computations, in particular over peer-to-peer and sensor networks, as it can provide a summary of some global sys...
Carlos Baquero, Paulo Sérgio Almeida, Raque...
HRI
2006
ACM
15 years 10 months ago
Effective team-driven multi-model motion tracking
Autonomous robots use sensors to perceive and track objects in the world. Tracking algorithms use object motion models to estimate the position of a moving object. Tracking effic...
Yang Gu, Manuela M. Veloso
IWOCA
2009
Springer
123views Algorithms» more  IWOCA 2009»
15 years 11 months ago
Computability of Width of Submodular Partition Functions
The notion of submodular partition functions generalizes many of well-known tree decompositions of graphs. For fixed k, there are polynomial-time algorithms to determine whether ...
Petr Skoda
3DIM
2005
IEEE
15 years 10 months ago
A MRF Formulation for Coded Structured Light
Multimedia projectors and cameras make possible the use of structured light to solve problems such as 3D reconstruction, disparity map computation and camera or projector calibrat...
Jean-Philippe Tardif, Sébastien Roy